Pagini recente » Cod sursa (job #3196362) | Borderou de evaluare (job #3249968) | Cod sursa (job #3214646) | Cod sursa (job #2821382) | Cod sursa (job #1246686)
#include <stdio.h>
int main() {
long v[1000000],n,i,j;
long long s=0;
FILE *f;
f=fopen("fractii.in","r"); fscanf(f,"%ld",&n); fclose(f);
for (i=2; i<=n; i++) v[i]=i-1;
for (i=2; i<=n; i++) {
if (i<=(int)n/2) {
j=2;
while (i*j<=n) { v[i*j]=v[i*j]-v[i]; j++; }
}
s+=v[i];
}
s=s*2+1;
f=fopen("fractii.out","w"); fprintf(f,"%ld",s); fclose(f);
return 0;
}