Pagini recente » Cod sursa (job #1478720) | Cod sursa (job #2173027) | Cod sursa (job #3256627) | Cod sursa (job #1319346) | Cod sursa (job #1327392)
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int MAX = 1000010;
int a[MAX];
long long N;
long long r;
long long s;
int main()
{
int i, j;
fin >> N;
for ( i = 2; i <= N; i++ )
a[i] = i;
for ( i = 2; i <= N; i++ )
if ( a[i] == i )
{
for( j = i; j <= N; j += i )
a[j] = a[j] / i * ( i - 1 );
}
for ( i = 1; i <= N; i++ )
r += a[i];
r = r * 2;
r += 1;
/* for ( i = 1; i <= N; i++ )
fout << a[i] << ' ';
fout << '\n'; */
fout << r << '\n';
fin.close();
fout.close();
return 0;
}