Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream f("pitic.in");
- ofstream g("pitic.out");
- const int NMAX=43;
- long long int a[NMAX+1][NMAX+1];
- int main()
- {
- long long int n,m;
- f>>n>>m;
- a[1][1]=1; // Pot ajunge in pozitia initiala doar intr-un mod
- for(int j=1;j<=m;j++)
- {
- for(int i=1;i<=n;i++)
- {
- // a[i][j] Reprezinta modurile in care pot ajunge la nivelul 1, distanta j
- if(i!=1)
- a[i][j]+=a[i-1][j-1]; // Diagonala dreapta sus
- if(j!=1)
- a[i][j]+=a[i][j-1]; // Dreapta
- if(i!=n)
- a[i][j]+=a[i+1][j-1]; // Diagonala dreapta jos
- }
- }
- g<<a[1][m];
- }
Add Comment
Please, Sign In to add comment