Cod sursa(job #3154578)
Utilizator | Data | 5 octombrie 2023 11:08:18 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int N)
{
int phi,d;
phi=N;
if(N>1)
{for(d=2;d<=N*N;d++)
{
if(N%d==0)
{
phi=phi/d*(d-1);
while(N%d==0)
{
N=N/d;
}
}
}
if(N>1)
{
phi=phi/N*(N-1);
}
return phi*2;
}
else{ return phi;}
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int N,i,t=0;
f>>N;
for(i=1;i<=N;i++)
{
t=t+euclid(i);
}
g<<t;
f.close();
g.close();
return 0;
}