Cod sursa(job #563933)
| Utilizator | Data | 26 martie 2011 13:39:32 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <cstdio>
#define SIZE 100
int main() {
int n, *fi, *prim, i, j;
long long rez = 0;
FILE *fin = fopen("fractii.in", "r");
FILE *fout = fopen("fractii.out", "w");
fscanf(fin,"%d",&n);
fi = new int[n+1];
prim = new int[n+1];
for(i=1;i<=n;i++) {
fi[i] = i;
prim[i] = 1;
}
for(i = 2;i<= n;i++) {
if(prim[i]) {
fi[i] = i-1;
for(j=i*2;j<=n;j+=i) {
prim[j] = 0;
fi[j] = (fi[j]/i)*(i-1);
}
}
}
for(i=1;i<=n;i++) {
rez += fi[i];
}
fprintf(fout, "%ld", 2*rez -1);
return 0;
}
