Pagini recente » Istoria paginii articole | Istoria paginii runda/easyy | Cod sursa (job #2536161) | Diferente pentru preoni-2007/runda-4/solutii intre reviziile 10 si 9 | Cod sursa (job #1484976)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("nunta.in");
ofstream g("nunta.out");
char a[210],b[210];
short n,t,i,c,d;
int main() {
f>>n;
for(c=d=a[1]=b[1]=1;n>1;n--) {
for(t=0,i=1;i<=c||i<=d||t;i++,t/=10)
b[i]=(t+=a[i]+b[i])%10;
for(d=i-1,t=0,i=1;i<=d;i++)
a[i]=b[i]-((i<=c)?a[i]:0)-t,a[i]+=(t=a[i]<0)*10;
for(c=i-1;c>1&&!a[c];c--);
}
for(i=d;i;i--)
g<<(short)b[i];
}