Cod sursa(job #445208)
| Utilizator | Data | 23 aprilie 2010 02:09:02 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int prime(int a,int b)
{
int c;
while(b!=0)
{
c=a;
a=b;
b=c%b;
}
if (a==1)
return 1;
return 0;
}
int main()
{
int n,p=1,q=1,c=0;
FILE *f=fopen("fractii.in","r");
fscanf(f,"%d",&n);
printf("n-ul citit este: %d \n",n);
while(p<=n)
{
if(p+q<=n)
{
c++;
q=p+q;
}
else
{
p++;
q=1;
c++;
}
}
FILE *out=fopen("fractii.out","w");
fprintf(out,"%d",(c-n)*2+1);
return 0;
}
