Pagini recente » Cod sursa (job #1202937) | Cod sursa (job #1634597) | Cod sursa (job #340200) | Cod sursa (job #3004396) | Cod sursa (job #2780917)
#include <fstream>
using namespace std;
const int nmax = 1e6;
int phi[nmax + 1];
ifstream fin ( "fractii.in" );
ofstream fout ( "fractii.out" );
int main() {
int n;
long long s ( 0 );
fin >> n;
for ( int i = 1; i <= n; i++ )
phi[i] = i;
for ( int i = 2; i <= n; i++ ) {
if ( phi[i] == i ) {
phi[i]--;
for ( int j = 2 * i; j <= n; j += i ) {
phi[j] = phi[j] * ( i - 1 ) / i;
} }
s += phi[i];
}
fout << 2 * s + 1;
return 0;
}