Cod sursa(job #2055537)
Utilizator | Data | 3 noiembrie 2017 13:20:32 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int main()
{
int n, phi[100000],i,j,sum=0;
in >> n;
for(i=1; i<=n; i++) //Ciurul lui Eratostene
phi[i] = i-1;
for(i=1; i<=n; i++)
for(j=2*i; j<=n; j+=i)
phi[j]-=phi[i];
for( i=1; i<=n; i++)
sum += phi[i];
out << sum*2+1;
return 0;
}