Pagini recente » Cod sursa (job #2434558) | Cod sursa (job #129415) | Cod sursa (job #1807530) | Cod sursa (job #2953380) | Cod sursa (job #2848977)
#include <iostream>
using namespace std;
int main()
{
#include <fstream>
using namespace std;
int main()
{
unsigned i, n, phi[999999];
unsigned long long x = 0;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>> n;
for (i = 2; i <= n;phi[i]=i, ++i);
for (i = 2; i <= n; ++i)
if (phi[i] == i)
for (unsigned j = i; j <= n; phi[j] /= i,phi[j]*=i - 1,j+=i);
for (i = 2; i <= n; x+=phi[i++]*2);
fout << x + 1;
}
return 0;
}