Pagini recente » Cod sursa (job #464760) | Cod sursa (job #2110477) | Cod sursa (job #797991) | Cod sursa (job #1869099) | Cod sursa (job #774054)
Cod sursa(job #774054)
#include <fstream>
using namespace std;
ifstream fin;
ofstream fout;
long long sieve[1000001];
int n;
int main(int argc, char const *argv[])
{
fin.open( "fractii.in" );
fin >> n;
fin.close();
int result = 0;
for( int i = 2; i <= n; ++i ) sieve[i] = i;
for( int i = 2; i <= n; ++i )
{
if( sieve[i] == i )
for( int j = i; j <= n; j += i )
{
sieve[j] /= i;
sieve[j] *= ( i - 1 );
}
result += sieve[i];x
}
result *= 2;
++result;
fout.open( "fractii.out" );
fout << result;
fout.close();
return 0;
}