Cod sursa(job #1517398)
Utilizator | Data | 4 noiembrie 2015 10:49:10 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <iostream>
using namespace std;
int main()
{
long long n,i,j,e[1000001],s=0;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=1;i<=n;i++)
e[i]=i;
for(i=2;i<=n;i++)
if(e[i]==i)
for(j=i;j<=n;j+=i)
e[j]=e[j]/i*(i-1);
for(i=1;i<=n;i++)
{s+=e[i];}
g<<2*s-1;
return 0;
}