Cod sursa(job #2116386)
Utilizator | Data | 27 ianuarie 2018 16:16:11 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int phi[1000008];
int total;
int main()
{
int N;
fin>>N;
for (int i = 1; i <= N; ++i)
phi[i] = i-1;
for (int i = 2; i <= N; ++i)
for (int j = 2*i; j <= N; j += i)
phi[j] -= phi[i];
for(int i = 1; i <= N; i++){
total += phi[i];
}
fout<<total*2+1;
}