Cod sursa(job #1978952)
| Utilizator | Data | 9 mai 2017 10:22:26 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
unsigned int phi[1000002];
int n;
int s;
void phi_calc()
{
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]=phi[j]-phi[j]/i;
}
}
int main()
{
int i, j;
fin>>n;
phi_calc();
for(i=1; i<=n; i++)
s+=phi[i];
fout<<2*s-1<<'\n';
return 0;
}
