Pagini recente » Cod sursa (job #1960569) | Cod sursa (job #241724) | Cod sursa (job #3228727) | Cod sursa (job #1834955) | Cod sursa (job #2393766)
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
int n;
fin >> n;
int phi[n+3];
for (int i = 1; i <= n; i++)
{
phi[i] = i - 1;
}
phi[1] = 1;
for (int i = 2; i <= n; i++)
{
for (int j = 2 * i; j <= n; j = j + i)
{
phi[j] = phi[j] - phi[i];
}
}
long long ans = 0;
for (int i = 2; i <= n; i++)
{
ans += 2 * phi[i];
}
ans += phi[1];
fout << ans;
fin.close();
fout.close();
return 0;
}