Pagini recente » Cod sursa (job #196896) | Cod sursa (job #1857684) | Cod sursa (job #1125111) | Cod sursa (job #1919161) | Cod sursa (job #772010)
Cod sursa(job #772010)
#include<fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
short a[3][251];
int n,i,j,size,p;
int main()
{f>>n;
a[0][0]=1;
a[1][0]=1;
size=0;
for(i=2; i<=n; i++)
{for(j=0; j<=size; j++)
{if((a[0][j]+a[1][j]+p)<10)
{a[2][j]=a[0][j]+a[1][j]+p;
p=0;}
else
{a[2][j]=(a[0][j]+a[1][j]+p)%10;
p=1;}}
if(p==1)
{size++; a[2][size]=1;}
for(j=0; j<=size; j++)
{a[0][j]=a[1][j];
a[1][j]=a[2][j];}
}
for(j=size; j>=0; j--)
g<<a[2][j];
f.close();
g.close();
return 0;}