Pagini recente » Cod sursa (job #2753090) | Diferente pentru concurs-mihai-patrascu-2013 intre reviziile 15 si 4 | Istoria paginii utilizator/horis | Istoria paginii utilizator/galansebi1999 | Cod sursa (job #1444046)
#include <stdio.h>
int main()
{
unsigned long *numitor,*numarator;
numitor=new unsigned long[1000000];
numarator=new unsigned long[1000000];
int k,n;
numarator[1]=1;numitor[1]=1;k=1;
scanf("%d",&n);
int gata=0;
while(!gata)
{gata=1;
for(int i=k;i<=k;i++)
if(numarator[i]+numitor[i]<=n)
{k++;
numitor[k]=numarator[i]+numitor[i];
numarator[k]=numarator[i];
k++;
numarator[k]=numitor[i]+numarator[i];
numitor[k]=numitor[i];
gata=0;
}
}
printf("%ld\n",k);
return 0;
}