Cod sursa(job #2685988)
Utilizator | Data | 18 decembrie 2020 11:26:46 | |
---|---|---|---|
Problema | Nunta | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
int n;
short int a[1001][300];
int main()
{
f>>n;
a[1][0]=a[2][0]=1;
a[1][1]=a[2][1]=1;
for (int i=3; i<=n+1; i++)
{
a[i][0]=a[i-1][0];
for(int j=1;j<=a[i][0];j++)
{
a[i][j]+=a[i-1][j]+a[i-2][j];
a[i][j+1]+=a[i][j]/10;
a[i][j]%=10;
}
if(a[i][a[i][0]+1]!=0)
{
a[i][0]++;
}
}
for(int i=a[n+1][0];i>=1;i--)
{
g<<a[n+1][i];
}
return 0;
}