Pagini recente » Cod sursa (job #2655338) | Cod sursa (job #2747909) | Cod sursa (job #1904507) | Cod sursa (job #188296) | Cod sursa (job #498200)
Cod sursa(job #498200)
#include <stdio.h>
#include <stdlib.h>
int ciur(long x, long y)
{
int k[1000001];
long i,j;
memset(k,0,1000001);
if(x%2==0)
{
for(i=2;i<=x;i+=2) k[i]=1;
}
for(j=3;j<=x;j+=2)
{
if(k[i]) continue;
if(x%j==0)
{
for(i=j;i<=x;i+=j) k[i]=1;
}
}
for(i=2;i<=x;i++)
if(k[i])
{
if(y%i==0) return 1;
}
return 0;
}
int main(void)
{
long i,j,n,k;
FILE *f,*g;
f=fopen("fractii.in","r");
g=fopen("fractii.out","w");
k=0;
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(ciur(i,j)) continue;
k++;
}
fprintf(g,"%ld\n",k);
fclose(f);
fclose(g);
return 0;
}