Cod sursa(job #1170936)
Utilizator | Data | 14 aprilie 2014 21:25:09 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
short phi[1000001];
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,k=1,i,j;
f>>n;
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=1;i<=n;i++)
{
k+=(2*phi[i]);
}
g<<k<<'\n';
f.close();
g.close();
return 0;
}