Pagini recente » Cod sursa (job #496080) | Cod sursa (job #1742241) | Cod sursa (job #2394633) | Cod sursa (job #1741073) | Cod sursa (job #1361834)
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int prim(int x)
{
int i;
if(x == 1)
return 0;
for(i = 2;i <= x / 2;i++)
if(x % i == 0)
return 0;
return 1;
}
int main()
{
FILE *file;
int n,i,j = 0,nr,*v;
v = malloc(1000*sizeof(int));
file = fopen("fractii.in","r");
fscanf(file,"%d",&n);
fclose(file);
for(i = 1;i <= n;i++)
if(prim(i) == 1)
{
v[j] = i;
j++;
}
nr = n * n;
nr -= n;
nr++;
for(i = 0;i < j;i++)
{
if(n / v[i] != 1)
{
nr -= (n / v[i] - 1) * n / v[i];
}
}
file = fopen("fractii.out","w");
fprintf(file,"%d",nr);
fclose(file);
}