Pagini recente » Cod sursa (job #1123416) | Cod sursa (job #496117) | Cod sursa (job #1583237) | Cod sursa (job #2802370) | Cod sursa (job #3145980)
#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;
}