Pagini recente » Cod sursa (job #1210213) | Cod sursa (job #2699456) | Cod sursa (job #3193257) | Cod sursa (job #2232884) | Cod sursa (job #338771)
Cod sursa(job #338771)
#include <iostream>
using namespace std;
int main()
{
int N, i, j, tmp, phi, a;
long long ret = 1;
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
cin >> N;
for ( i = 2; i <= N; ++i )
{
phi = 1, a = i;
for ( j = 2; j <= a / j; ++j )
{
tmp = 1;
while ( a % j == 0 )
a /= j, tmp *= j;
if ( tmp > 1 )
{
phi = phi*(j-1);
phi = phi*(tmp/j);
}
}
if ( a > 1 )
phi = phi * (a - 1);
ret += (phi << 1);
}
cout << ret << endl;
return 0;
}