Cod sursa(job #2400557)
Utilizator | Data | 8 aprilie 2019 20:47:49 | |
---|---|---|---|
Problema | Nunta | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("nunta.in");
ofstream fout("nunta.out");
int n,i;
int d[1000][10000];
void ad(int a[],int b[],int c[]){
int t=0,i;
c[0]=max(a[0],b[0]);
for(i=1;i<=c[0];i++){
c[i]=a[i]+b[i]+t;
t=c[i]/10;
c[i]%=10;
}
if(t)c[++c[0]]=t;
}
int main(){
fin>>n;
d[1][0]=1;d[1][1]=1;
d[2][0]=1;d[2][1]=2;
d[3][0]=1;d[3][1]=3;
for(i=4;i<=n;i++)
ad(d[i-2],d[i-1],d[i]);
for(i=d[n][0];i;i--)
fout<<d[n][i];
return 0;
}