Pagini recente » Cod sursa (job #143119) | Cod sursa (job #2966052) | Cod sursa (job #2844751) | Cod sursa (job #884099) | Cod sursa (job #2022154)
#include<fstream>
using namespace std;
ifstream in("nunta.in");
ofstream out("nunta.out");
short v1[1001],v2[1001];
short n;
void add( short a[1001], short b[1001] ){
int t=0,i;
for (i = 1; i <= a[0] || t > 0; i ++ ){
a[i] += b[i] + t;
t = a[i]/10000;
a[i] %= 10000;
}
a[0] = i-1;
return;
}
int main(){
in >> n;
v1[0] = 1; v2[0] = 1; v1[1] = 1; v2[1] = 1;
for( int i = 2; i <= n; i ++ ){
if( i%2 == 0 ){
add( v1, v2 );
}
else{
add( v2, v1 );
}
}
short x;
if( n % 2 == 0 ){
for( int i = v1[0]; i >= 1; i -- ){
x = v1[i];
out<<x;
}
}
else{
for( int i = v2[0]; i >= 1; i -- ){
x = v2[i];
out<<x;
}
}
return 0;
}