Pagini recente » Cod sursa (job #1178778) | Cod sursa (job #1794465) | Cod sursa (job #1363554) | Cod sursa (job #1898419) | Cod sursa (job #1311946)
#include<fstream>
using namespace std;
ifstream in("nunta.in");
ofstream out("nunta.out");
short int a[500],b[500];
void aduna()
{
short int t = 0,sum;
short int i;
for(i = 1 ; i <= b[0] || i <= a[0]; i++)
{
sum = a[i] + b[i];
a[i] = sum % 10;
t = sum / 10;
}
if(t){
a[0] = i;
a[a[0]] = t;
}
else
a[0] = i-1;
}
void afis(short int nr[])
{
for(short int i = nr[0]; i >= 1 ; i--)
out<<nr[i];
}
void sw()
{
for(short int i = 0 ; i <= max(a[0],b[0]) ; i++)
swap(a[i],b[i]);
}
int main()
{
a[0] = a[1] = b[0] = 1;
b[1] = 2;
short int n;
in>>n;
if(n == 1){
afis(a);
return 0;
}
if(n == 2)
{
afis(b);
return 0;
}
for(int i = 3 ; i <= n ; i++){
aduna();
sw();
}
afis(b);
return 0;
}