Pagini recente » Cod sursa (job #190832) | Cod sursa (job #1613468) | Cod sursa (job #2826041) | Cod sursa (job #2242144) | Cod sursa (job #2831470)
#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;
}