Cod sursa(job #3273150)
Utilizator | Data | 1 februarie 2025 10:51:09 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | cex_8 | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int euler( int n)
{
int r=n, d=2;
while(n>1)
{
if(n%d==0)
{
r=r/d*(d-1);
while(n%d==0)n/=d;
}
d++;
if(d*d>n)d=n;
}
return r;
}
int main()
{
int n;
f>>n; int nr=1;
for(int i=2;i<=n;i++)
{
nr+=euler(i)*2;
}
g<<nr;
return 0;
}