Pagini recente » Borderou de evaluare (job #2803586) | Borderou de evaluare (job #1837133) | Borderou de evaluare (job #208975) | Borderou de evaluare (job #2520007) | Cod sursa (job #568775)
Cod sursa(job #568775)
#include <stdio.h>
#include<math.h>
long n,i,num,max,j,k,ok;
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%ld",&n);
num=n+n-1;
for (i=2;i<=n;i++)
for (j=2;j<=n;j++)
{
if (i==j)
continue;
if (i>j)
max=i;
else
max=j;
ok=0;
if (i%2==0&&j%2==0)
ok=1;
for (k=3;k<=sqrt(k);k=k+2)
if (i%k==0&&j%k==0)
ok=1;
if (ok==0)
num++;
}
printf("%ld",num);
}