Cod sursa(job #2695818)
Utilizator | Data | 14 ianuarie 2021 17:00:39 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long N,sum=1;
int phi[1000000];
int main()
{
f>>N;
for(int i=2;i<=N;i++)
phi[i]=i-1;
for(int i=2;i<=N;i++)
{
for(int j=2*i;j<=N;j+=i)
phi[j]-=phi[i];
sum+=phi[i];
}
g<<2*sum-1;
return 0;
}