Pagini recente » Cod sursa (job #780231) | Cod sursa (job #386278) | Cod sursa (job #1194320) | Cod sursa (job #87910) | Cod sursa (job #1140411)
#include <fstream>
using namespace std;
ifstream fin ("nunta.in");
ofstream fout ("nunta.out");
int n, i, d[4][210],j;
void suma (int x, int y ,int z ) {
int maxim=d[x][0];
int t=0;
if (d[y][0]>maxim)
maxim=d[y][0];
for (int i=1;i<=maxim;i++) {
d[z][i]=d[x][i]+d[y][i]+t;
t=d[z][i]/10;
d[z][i]%=10;
}
d[z][0]=maxim;
if (t!=0)
d[z][++d[z][0]]=t;
}
int main () {
fin>>n;
d[1][0]=d[1][1]=d[2][0]=1;
d[2][1]=2;
for (i=3;i<=n;i++){
suma (1,2,3);
for (j=0;j<=d[2][0];j++)
d[1][j]=d[2][j];
for (j=0;j<=d[3][0];j++)
d[2][j]=d[3][j];
}
for (i=d[3][0];i>=1;i--)
fout<<d[3][i];
return 0;
}