Pagini recente » Cod sursa (job #1513193) | Cod sursa (job #829274) | Cod sursa (job #2833406) | Cod sursa (job #699503) | Cod sursa (job #2663752)
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int limit = 1000005;
int phi[limit];
int main()
{
for(int i=2;i<limit;i++)
phi[i]=i;
for(int i=2;i<limit;i++) if(phi[i]==i)
{
phi[i]--;
for(int j=i+i;j<limit;j+=i)
phi[j]=phi[j]/i*(i - 1);
}
long long sum=0, n;
fin >> n;
for(int i=1;i<=n;i++)
sum += phi[i];
fout << sum+sum+1;
return 0;
}