Cod sursa(job #1517403)
Utilizator | Data | 4 noiembrie 2015 10:53:39 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int main()
{
long long n,i,j,s=0,e[1000001];
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=s+e[i];
}
g<<2*s-1;
return 0;
}