Cod sursa(job #2330559)
Utilizator | Data | 28 ianuarie 2019 16:35:21 | |
---|---|---|---|
Problema | Fractii | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
long long s;
int euler(int n)
{
int cn=n,d=2;
while(n>1)
{
if(n%d==0)
{
cn=(cn/d)*(d-1);
while(n%d==0)
n/=d;
}
if(d==2)
d++;
else
d+=2;
if(d*d>n)
d=n;
}
return cn;
}
int main()
{
f>>n;
for(int i=1; i<=n; ++i)
s+=euler(i);
g<<2*s-1;
return 0;
}