Cod sursa(job #1283175)
| Utilizator | Data | 5 decembrie 2014 11:03:40 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
const int NMAX = 1000010;
int N, Phi[NMAX];
long long Ans;
int main()
{
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
for(int i = 2; i < NMAX; ++ i) Phi[i] = i - 1;
for(int i = 2; i < NMAX; ++ i)
for(int j = i + i; j < NMAX; j += i)
Phi[j] -= Phi[i];
scanf("%i", &N);
for(int i = 2; i <= N; ++ i) Ans += 2LL * Phi[i];
Ans ++;
printf("%lld\n", Ans);
}
