Cod sursa(job #1208713)
Utilizator | Data | 16 iulie 2014 14:08:19 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
int phi[1000001];
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{ int N;
long long s=0;
f>>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=2; i<=N; ++i)
s=s+phi[i];
g<<2*s+1<<"\n";
return 0;
}