Pagini recente » Istoria paginii preoni-2005/runda-1/solutii | Cod sursa (job #2247263) | Monitorul de evaluare | Istoria paginii runda/simulare-cartita-01/clasament | Cod sursa (job #2021058)
#include <fstream>
std::ifstream si("nunta.in");
std::ofstream so("nunta.out");
short a[126],b[126];
int main()
{
int n,k;
short x,t;
si>>n;
a[1]=b[1]=1;
k=1;
short nr;
for(int i=2;i<=n;++i)
{
t=0;
for(int j=1;j<=k;j++)
{
nr=b[j];
x=a[j]+b[j]+t;
b[j]=x%100000000;
t=x/100000000;
a[j]=nr;
}
if(t>0)
{
k++;
b[k]=t;
}
}
if(n==1)
so<<1;
else
for(int i=k;i>0;--i)
{
so<<b[i];
}
return 0;
}