Pagini recente » Cod sursa (job #878255) | Cod sursa (job #1129760) | Cod sursa (job #1608119) | Cod sursa (job #712735) | Cod sursa (job #256008)
Cod sursa(job #256008)
#include<stdio.h>
int prim(long int a, long int b)
{
if (a==b) goto x;
do
{
if (a>b) a=a-b; else if (b>a) b=b-a;
}
while(a!=b);
x: if (a==1) return 1; else return 0;
}
int main()
{
FILE *in=fopen("fractii.in","r"),
*out=fopen("fractii.out","w");
long int n,i,j,s;
fscanf(in,"%ld",&n);
s=n*2-1;
for (i=2;i<=n;i++)
{
for (j=2;j<=n;j++)
{
if (prim(i,j)==1) s++;
}
}
fprintf(out,"%ld",s);
return 0;
}