Pagini recente » Cod sursa (job #48970) | Cod sursa (job #1052101) | Rating Moldoveanu Daniel-Stefan (Dany_perfect) | Cod sursa (job #2351098) | Cod sursa (job #115300)
Cod sursa(job #115300)
#include<stdio.h>
#include<iostream.h>
#include<math.h>
int main()
{
long i,j,n,c=0,a,b,r;
FILE *in,*out;
in=fopen("fractii.in","rt");
out=fopen("fractii.out","wt");
fscanf(in,"%ld",&n);
c=0;
for (i=1;i<=n;i=i+1)
{
for (j=1;j<=n;j=j+1)
{
a=i;
b=j;
while (a%b!=0)
{
r=a%b;
a=b;
b=r;
}
if (b==1) c=c+1;
}
}
fprintf(out,"%ld",c);
}