Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <vector>
- #include <string>
- #include <algorithm>
- #include <fstream>
- #include <set>
- #include <iomanip>
- #include <iso646.h>
- #define sync ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
- #define ss second
- #define ff first
- #define ll long long
- #define mp make_pair
- #define endl "\n"
- #define pb push_back
- #define ld long double
- #define M_PI 3.14159265358979323846 /* pi */
- const double EPS=0.000000000001;
- using namespace std;
- const int INF=100000000;
- int main()
- {
- int n,m;
- cin>>n>>m;
- vector<vector<int> > a(n,vector<int>(n));
- vector< vector< vector<int> > > dp(n,vector<vector<int> > (n));
- for (int i=0;i<n;i++)
- for (int j=0;j<n;j++)
- {
- cin>>a[i][j];
- if (a[i][j]==1)
- dp[i][j].resize(m+1,1);
- else
- dp[i][j].resize(m+1,0);
- }
- for (int i=n-2;i>=0;i--)
- for (int k=0;k<=m;k++)
- {
- dp[n-1][i][k]=dp[n-1][i][k]+dp[n-1][i+1][k-1];
- }
- for (int i=n-2;i>=0;i--)
- for (int k=0;k<=m;k++)
- {
- dp[i][n-1][k]=dp[i][n-1][k]+dp[i+1][n-1][k-1];
- }
- for (int i=n-2;i>=0;i--)
- for (int j=n-2;j>=0;j--)
- for (int k=0;k<=
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement