Cod sursa(job #1893218)
| Utilizator | Data | 25 februarie 2017 15:51:23 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <cstdio>
using namespace std;
int NMAX = 1000000;
long long c[1000005];
void ciur() {
for(int i = 2; i <= NMAX; ++ i) {
c[i] = i;
}
for(int i = 2; i <= NMAX; ++ i) {
if(c[i] == i) {
for(int j = i; j <= NMAX; j += i) {
c[j] = c[j] / i * (i - 1);
}
}
}
}
int main() {
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
ciur();
int n;
long long rasp = 1;
scanf("%d", &n);
for(int i = 2; i <= n; ++ i) {
rasp += 2 * c[i];
}
printf("%lld", rasp);
return 0;
}
