Cod sursa(job #2099778)
| Utilizator | Data | 4 ianuarie 2018 17:50:41 | |
|---|---|---|---|
| Problema | Fractii | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
long long phi[1000001];
int n;
long long s=0;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(int i=2; i<=n; i++) phi[i]=i-1;
for(int i=2; i<=n; i++)
{
int c=2*i;
for(int j=c; j<=n; j+=i)
{
phi[j]-=phi[i];
}
}
long long s=0;
for(int i=2; i<=n; i++) s+=phi[i];
g<<2*s+1;
return 0;
}
