Cod sursa(job #2397576)
Utilizator | Data | 4 aprilie 2019 16:15:41 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,phi[1000001];
int64_t sol;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
phi[i]=i;
for(int i=2;i<=n;i++)
{
if(phi[i]==i)
for(int j=i;j<=n;j+=i)
phi[j]=phi[j]/i*(i-1);
sol+=phi[i];
}
sol=2*sol+1;
g<<sol;
return 0;
}