Pagini recente » Cod sursa (job #1587279) | Cod sursa (job #1385802) | Cod sursa (job #3180464) | Cod sursa (job #1568206) | Cod sursa (job #326536)
Cod sursa(job #326536)
//#include <iostream>
#include <fstream>
using namespace std;
#define MAX 1000001
int mult[MAX];
int main(){
ifstream in;
ofstream out;
int N, i, j;
long long sol = 0;
in.open("fractii.in");
in >> N;
in.close();
for (i=2; i<=N; i++)
mult[i] = i;
for (i=2; i<=N; i++)
{
if (mult[i] == i)
for (j=i; j <= N; j += i)
{
mult[j] /= i;
mult[j] *= (i - 1);
}
sol += mult[i];
}
out.open("fractii.out");
out << sol*2 + 1;
out.close();
return 0;
}