Pagini recente » Cod sursa (job #1762215) | Cod sursa (job #2169277) | Arhiva de probleme | Arhiva de probleme | Cod sursa (job #9069)
Cod sursa(job #9069)
#include <stdio.h>
#include <fstream.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;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>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;
}
}
g<<k;
return 0;
}