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