Cod sursa(job #1910507)
Utilizator | Data | 7 martie 2017 17:13:54 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
long phi[1000001];
int main()
{
long i,s=1,j,n;
in>>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=2;i<=n;i++)
s=s+phi[i]*2;
out<<s;
return 0;
}