Pagini recente » Cod sursa (job #1167888) | Cod sursa (job #763203) | Cod sursa (job #2767250) | Cod sursa (job #1347285) | Cod sursa (job #2116409)
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long long int phi[1000008];
int main()
{
int N,i,j;
fin>>N;
for (i = 1; i <= N; ++i)
phi[i] = i-1;
long long int total = 0;
for (i = 2; i <= N; ++i){
for (j = 2*i; j <= N; j += i)
phi[j] -= phi[i];
total += phi[i-1];
}
total += phi[N];
fout<<total*2+1;
}