Cod sursa(job #2742536)
Utilizator | Data | 21 aprilie 2021 10:03:18 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,phi[1000005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
phi[i] = i-1;
}
long long sum = 0;
for(int i=2;i<=n;i++)
{
if(phi[i])
{
for(int j=i*2;j<=n;j+=i)
{
phi[j]-=phi[i];
}
}
sum+=phi[i];
}
g<<2*sum+1<<'\n';
return 0;
}