Pagini recente » Cod sursa (job #2105370) | Cod sursa (job #948712) | Cod sursa (job #988464) | Cod sursa (job #2240019) | Cod sursa (job #2497018)
#include <fstream>
int N;
unsigned long S = 1;
int phi(int n)
{
int result = n, p = 2;
while (p * p <= n)
{
if (n % p == 0)
{
while (n % p == 0)
{
n /= p;
}
result -= result / p;
}
++p;
}
if (n > 1)
{
result -= result / n;
}
return result;
}
int main()
{
std::ifstream fisierIN("fractii.in");
fisierIN >> N;
fisierIN.close();
for (int k = 2; k <= N; ++k)
{
S += 2U * phi(k);
}
std::ofstream fisierOUT("fractii.out");
fisierOUT << S;
fisierOUT.close();
return 0;
}