Pagini recente » Cod sursa (job #2470962) | Cod sursa (job #1973451) | Cod sursa (job #1686194) | Cod sursa (job #867777) | Cod sursa (job #2931950)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
const int NMAX = 1e6;
int c[NMAX+1];
int main()
{
for(int i=1; i<=NMAX; i++)
c[i] = i;
for(int i=2; i<=NMAX; i++)
if(c[i] == i)
for(int j=i; j<=NMAX; j+=i)
c[j] = c[j]/i*(i-1);
long long sum = 1;
int n;
f>>n;
for(int i=2; i<=n; i++)
sum += 2*c[i];
g<<sum;
return 0;
}