Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("alice_xi.in");
- ofstream fout("alice_xi.out");
- int n;
- long long A[36][36];
- int main()
- {
- fin>>n;
- A[1][1]=1;
- for(int i=2;i<=n;++i)
- for(int j=1;j<=i;++j)
- if(j==1)
- A[i][j]=A[i-1][j]+A[i-1][j+1];
- else if(j==i)
- A[i][j]=A[i-1][j-1];
- else
- A[i][j]=A[i-1][j-1]+A[i-1][j]+A[i-1][j+1];
- for(int i=1;i<n;++i)
- A[n][n]+=A[n][i];
- fout<<A[n][n];
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement