Pagini recente » Cod sursa (job #278006) | Cod sursa (job #2687777) | Istoria paginii runda/sanki | Monitorul de evaluare | Cod sursa (job #1474328)
#include<cstdio>
FILE *f,*g;
int euclid(int p, int q)
{int aux;
do{
aux=p%q;
p=q;
q=aux;
}while(aux);
if (p==1) return 1;
else return 0; }
int main(){
int t=0, N;
f=fopen("Fractii.in","r");
g=fopen("Fractii.out","w");
fscanf(f,"%d",&N);
for(int i=1; i<=N; i++)
for (int j=1; j<=N; j++)
if (euclid(i,j)==1) t++;
fprintf(g,"%d",t);
fclose(f);
fclose(g);
return 0;
}