Pagini recente » Cod sursa (job #2592283) | Cod sursa (job #1423520) | Cod sursa (job #426229) | Cod sursa (job #2069187) | Cod sursa (job #192082)
Cod sursa(job #192082)
#include<stdio.h>
long v[1000000],n;
long tot(long x)
{ long nr_tot=x;
for(long i=1;i<=x;i++)
if(v[i]==0 && x%i==0)
nr_tot=nr_tot*(i-1)/i;
return nr_tot;
}
int main()
{
FILE*f=fopen("fractii.in","r");
FILE*g=fopen("fractii.out","w");
long n,i,j,nr;
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
v[i]=0;
v[1]=1;
long k=1;
do
{
long m = k+1;
for(i=1;i<=n;i++)
if(v[i]==0 && i%m==0 && i/m!=1)
v[i]=1;
k=m;
}
while(k <= n/2);
nr=0;
for(i=2;i<=n;i++)
nr=nr+tot(i);
nr=nr*2+1;
fprintf(g,"%ld",nr);
fclose(f);
fclose(g);
return 0;
}