Pagini recente » Cod sursa (job #73708) | Cod sursa (job #2817897) | Cod sursa (job #2394847) | Cod sursa (job #2960645) | Cod sursa (job #2400589)
#include <fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
int n, d[1001][1001],i;
void aduna (int rez[], int nr1[], int nr2[]){
rez[0]=max(nr1[0], nr2[0]);
for(int i=nr1[0]+1; i<=nr2[0]; i++) nr1[i]=0;
for(int j=nr2[0]+1; j<=nr1[0]; i++) nr2[i]=0;
int t=0;
for(int i=1; i<=rez[0]; i++) {
rez[i]=nr1[i]+nr2[i]+t;
t=rez[i]/10;
rez[i]%=10;
}
if(t) rez[++rez[0]]=t;
}
int main()
{
f>>n;
d[1][0]=d[1][1]=1;
d[2][0]=1; d[2][1]=2;
for(i=3;i<=n;i++) aduna (d[i], d[i-1], d[i-2]);
for( i=d[n][0]; i>=1; i--) g<<d[n][i];
return 0;
}