Cod sursa(job #1472684)
Utilizator | Data | 17 august 2015 16:08:07 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int Max = 1000005;
int phi[Max];
long long ans;
void Solve(int k){
for (int i = 1; i <= k; ++i)
phi[i] = i-1;
for (int i = 2; i <= k; ++i){
for (int j = 2*i; j <= k; j += i)
phi[j] -= phi[i];
ans += (1LL * 2 * phi[i]);
}
}
int main(){
int n;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin >> n;
fin.close();
Solve(n);
fout << ++ans;
fout.close();
return 0;
}