Pagini recente » Cod sursa (job #613896) | Cod sursa (job #2345043) | Cod sursa (job #2475780) | Cod sursa (job #903656) | Cod sursa (job #1276388)
#include <fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
short int a[102],b[102];
int n;
void adunare (short int A[] ,short int B[])
{
int t=0,i;
for (i=1;i<=A[0] || i<=B[0] || t; i++ , t/=10)
{
t=t+A[i]+B[i];
A[i]=t%10;
}
A[0]=i-1;
}
int main()
{
a[0]=1; a[1]=1;
b[0]=1; b[1]=2;
f>>n;
int i;
if (n==1) g<<"1";
else if (n==2) g<<"2";
else
{
for (i=3;i<=n;i++)
{
if (i%2)
adunare(a,b);
else
adunare(b,a);
}
}
if (n%2==0)
for (i=b[0];i>=1;i--)
g<<b[i];
else
for (i=a[0];i>=1;i--)
g<<a[i];
f.close();
g.close();
return 0;
}