Pagini recente » Cod sursa (job #3325928) | Cod sursa (job #747997) | Cod sursa (job #3346958) | Cod sursa (job #923033) | Cod sursa (job #3328279)
#include <fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
int suma, n,a[211], b[211], c[211],i;
void adunare (int a[211], int b[211] ){
int i;
if (a[0]<b[0]) swap(a[0],b[0]);
int t=0;
for(i=1;i<=a[0];i++){
suma=a[i]+b[i]+t;
if (suma>9){t=1;
c[i]=suma%10;
}
else { c[i]=suma;t=0;}
}
c[0]=a[0];
if (t==1) c[++c[0]]=1;
for(i=1;i<=a[0];i++) a[i]=b[i];
a[0]=b[0];
for(i=1;i<=c[0];i++) b[i]=c[i];
b[0]=c[0];
}
int main()
{
f>>n;
a[0]=b[0]=1;
a[1]=1;b[1]=2; if (n==1)g<<1;
else if (n==2)g<<2;
else {
for (i=3;i<=n;i++)adunare(a,b);
for(i=c[0];i>=1;i--)g<<c[i];
}
return 0;
}