Pagini recente » Cod sursa (job #3242438) | Cod sursa (job #303149) | Statistici octav d (petrepetre) | Cod sursa (job #296227) | Cod sursa (job #2231167)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int Euler[100001];
int main()
{
int N;
long long sum = 0;
f >> N;
for(int i = 2; i <= N; i++)
Euler[i] = i - 1;
for(int i = 2; i <= N; i++)
{
for(int j = 2 * i; j <= N; j+=i)
Euler[j] -= Euler[i];
sum += Euler[i];
}
g << 2 * sum + 1;
return 0;
}