Pagini recente » Cod sursa (job #2045638) | Cod sursa (job #268387) | Cod sursa (job #453086) | Cod sursa (job #2442583) | Cod sursa (job #181807)
Cod sursa(job #181807)
#include <iostream.h>
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int fractii(int n)
{
int count=0;
count=2*n-1;
for (int i=2;i<=n;i++)
/*if (i%2!=0) */for(int j=2;j<=n;j++)
if (euclid(i,j)==1) count++;
//else for(int k=1;k<=(n/2)+;k++)
// if (euclid(i,k)==1) count++;
return count;
}
int main()
{
FILE *f,*g;
long n,nr;
f=fopen("fractii.in","r");
fscanf(f,"%ld",&n);
nr=fractii(n);
g=fopen("fractii.out","w+");
fprintf(g,"%ld",nr);
fclose(f);
fclose(g);
return 0;
}