Cod sursa(job #600189)
Utilizator | Data | 30 iunie 2011 18:41:08 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
long phi[1000000];
using namespace std;
int main()
{long long i,n,c=0,j;
ifstream f("fractii.in");
ofstream g("fractii.out");
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=j+ i)
phi[j]= phi[j] - phi[i];
for (i=1;i<=n;i++)
c=c+phi[i];
cout<<c*2+1;
g<<c*2+1;
g.close();
f.close();
return 0;
}