Advertisement
Guest User

Untitled

a guest
Feb 20th, 2017
518
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.11 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <string>
  5. #include <algorithm>
  6. #include <fstream>
  7. #include <set>
  8. #include <iomanip>
  9. #include <iso646.h>
  10. #define sync ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  11. #define ss second
  12. #define ff first
  13. #define ll long long
  14. #define mp make_pair
  15. #define endl "\n"
  16. #define pb push_back
  17. #define ld long double
  18. #define M_PI 3.14159265358979323846 /* pi */
  19. const double EPS=0.000000000001;
  20. using namespace std;
  21. const int INF=100000000;
  22.  
  23. int main()
  24. {
  25. int n,m;
  26. cin>>n>>m;
  27. vector<vector<int> > a(n,vector<int>(n));
  28. vector< vector< vector<int> > > dp(n,vector<vector<int> > (n));
  29. for (int i=0;i<n;i++)
  30. for (int j=0;j<n;j++)
  31. {
  32. cin>>a[i][j];
  33. if (a[i][j]==1)
  34. dp[i][j].resize(m+1,1);
  35. else
  36. dp[i][j].resize(m+1,0);
  37. }
  38. for (int i=n-2;i>=0;i--)
  39. for (int k=0;k<=m;k++)
  40. {
  41. dp[n-1][i][k]=dp[n-1][i][k]+dp[n-1][i+1][k-1];
  42. }
  43.  
  44. for (int i=n-2;i>=0;i--)
  45. for (int k=0;k<=m;k++)
  46. {
  47. dp[i][n-1][k]=dp[i][n-1][k]+dp[i+1][n-1][k-1];
  48. }
  49. for (int i=n-2;i>=0;i--)
  50. for (int j=n-2;j>=0;j--)
  51. for (int k=0;k<=
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement