Cod sursa(job #3146236)
| Utilizator | Data | 19 august 2023 13:38:09 | |
|---|---|---|---|
| Problema | Fractii | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <bits/stdc++.h>
#define N 1000000
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long n, r, i;
static inline long long Phi(long long nr) {
long long d = 2;
long long r = nr;
while(1 < nr && d * d <= nr) {
if(nr % d == 0) {
r = r / d * (d - 1);
while(nr % d == 0) nr /= d;
}
d++;
}
if(nr > 1) r = r / nr * (nr - 1);
return r;
}
int main() {
fin >> n;
for(i = 2; i <= n; i++) r += Phi(i);
fout << r * 2 + 1;
return 0;
}
