Cod sursa(job #2263925)
Utilizator | Data | 19 octombrie 2018 16:29:42 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
const int N = 1000010;
int n,i,j,phi[N];
long long sol = 1LL;
int main()
{
f>>n;
for(i=2;i<=n;i++)
phi[i]=i;
for(i=2;i<=n;i++)
{
if(phi[i]==i)
for(j=i;j<=n;j+=i)
phi[j]=phi[j]/i*(i-1);
sol+=2LL*phi[i];
}
g<<sol;
return 0;
}