Cod sursa(job #2565079)
Utilizator | Data | 2 martie 2020 12:01:46 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
const int N = 1000010;
int n,phi[N];
int main(void)
{
f>>n;
int64_t rez=1;
for(int i=2;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);
rez+=2*phi[i];
}
g<<rez;
return 0;
}