Pagini recente » Cod sursa (job #1133143) | Cod sursa (job #1130631) | Cod sursa (job #1546789) | Cod sursa (job #2412833) | Cod sursa (job #895720)
Cod sursa(job #895720)
#include <iostream>
#include <fstream>
using namespace std;
long long sum,phi[1000001];
int main()
{
int i,n,j;
ifstream f("fractii.in");
f>>n;
for (int i=2;i<=n;i++)
phi[i]=i;
for (i=2;i<=n;i++)
if (phi[i]==i)
for (j=i;j<=n;j+=i)
phi[j]=phi[j]*(i-1)/i;
for(i=2;i<=n;i++)
sum+=phi[i];
ofstream g("fractii.out");
g<<(2*sum)+1<<"\n";
f.close();
g.close();
return 0;
}