Cod sursa(job #1886470)
Utilizator | Data | 20 februarie 2017 21:48:27 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long phi[1000000];
int n;
void phi1()
{
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]/=i,phi[j]*=(i-1);
}
int main()
{
long long s=0;
f>>n;
phi1();
for(int i=2;i<=n;++i)
s+=phi[i];
g<<2*s+1;
}