Cod sursa(job #2541687)
Utilizator | Data | 8 februarie 2020 18:39:57 | |
---|---|---|---|
Problema | Fractii | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
unsigned int n,i,j,sol,phi[1000010];
int main() {
fin>>n;
//phi[i]=numarul numerelor prime mai mici decat i(indicatorul lui euler)
for (i=1;i<=n;i++)
phi[i]=i-1;
for (i=2;i<=n;i++)
for (j=2*i;j<=n;j+=i)
phi[j]-=phi[i];
for (i=2;i<=n;i++)
sol+=phi[i];
fout<<1+2*sol;
return 0;
}