Cod sursa(job #2051687)
Utilizator | Data | 29 octombrie 2017 13:43:23 | |
---|---|---|---|
Problema | Nunta | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <cstdio>
#define LMAX 210
using namespace std;
unsigned char A[LMAX],B[LMAX];
int main()
{
freopen ("nunta.in","r",stdin);
freopen ("nunta.out","w",stdout);
unsigned short int N,i,j,t;
scanf("%d",&N);
A[0]=A[1]=B[0]=B[1]=1;
for(i=2;i<=N;i++)
{
t=0;
for(j=1;j<=B[0]||t;j++)
{
t+=A[j]+B[j];
A[j]=B[j];
B[j]=t%10;
t/=10;
}
A[0]=B[0];
B[0]=j-1;
}
for(i=B[0];i>=1;i--)
fputc(B[i]+'0',stdout);
}