Cod sursa(job #2403623)
| Utilizator | Data | 11 aprilie 2019 18:59:20 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
#define NMax 1000010
int n, rez;
int phi[NMax];
int main(){
int i, j;
fin >> n;
for(i = 1; i <= n; i++) phi[i] = i - 1;
for(i = 1; i <= n; i++)
for(j = i + i; j <= n; j += i)
phi[j] -= phi[i];
for(i = 2; i <= n; i++) rez += phi[i];
fout << rez * 2 + 1;
}
