Cod sursa(job #3145980)
| Utilizator | Data | 17 august 2023 18:13:47 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int Euler[1000001];
int main()
{
int N,i,j;
long long int Sol=0;
f>>N;
for(i=2;i<=N;i++)
Euler[i]=i;
for(i=2;i<=N;i++)
{
if(Euler[i]==i)
for(j=i;j<=N;j+=i)
Euler[j]=Euler[j]/i*(i-1);
Sol+=Euler[i];
}
g<<2*Sol+1;
f.close();
g.close();
return 0;
}
