Pagini recente » Cod sursa (job #566884) | Cod sursa (job #1356371) | Cod sursa (job #1532174) | Cod sursa (job #2599037) | Cod sursa (job #2780955)
#include <fstream>
#define MAXN 1000000
using namespace std;
ifstream fin( "fractii.in" );
ofstream fout( "fractii.out" );
int euler[MAXN + 1];
void indicator( int n ){
int i, j;
for( i = 1; i <= n; i++ )
euler[i] = i;
for( i = 2; i <= n; i++ )
if( euler[i] == i ) //i e prim
for( j = i; j <= n; j += i )
euler[j] = euler[j] / i * (i - 1);
}
int main(){
int n, i;
long long sum;
fin >> n;
indicator(n);
sum = 1;
for( i = 1; i <= n; i++ )
sum += (2 * euler[i]);
fout << sum - 2;
}