Pagini recente » Cod sursa (job #2036536) | Cod sursa (job #152158) | Cod sursa (job #5051) | Cod sursa (job #2236472) | Cod sursa (job #6674)
Cod sursa(job #6674)
#include<stdio.h>
#include<math.h>
FILE *f1,*f2;
int main()
{long int j,v[15000];long unsigned n,i;int nr,ok;double p,s;
f1=fopen("fractii.in","r");
f2=fopen("fractii.out","w");
v[0]=1;
v[1]=2;
nr=1;
fscanf(f1,"%lu",&n);
fclose(f1);
if(n<=1)s=n;
else {
s=3;
for(i=3;i<=n;i++){
p=i;j=1;ok=0;while((j<=nr)&&(v[j]<=sqrt(i)))
{
if(i%v[j]==0){ok=1;p=p/v[j]*(v[j]-1);}
j++;}
if((!ok)){
if((v[j]>=sqrt(i))&&(i>v[nr]))v[++nr]=i;
p=p/i*(i-1);
}
s+=2*p;
} }
fprintf(f2,"%.0lf",s);
fclose(f2);
return 0;}