Pagini recente » Cod sursa (job #813449) | Cod sursa (job #68634) | Cod sursa (job #1275242) | Cod sursa (job #1811971) | Cod sursa (job #2829563)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n;
long long s = 0;
int cmmdc(int a, int b)
{
if(a < b)
swap(a, b);
while(b)
{
int r = a % b;
a = b;
b = r;
}
return a;
}
int indicator_euler(int n)
{
int cnt = 1, phi = 1, d = 2, copie = n;
while(n > 1)
{
int p = 0;
while(n % d == 0)
n /= d, p++;
cnt *= (p + 1);
if(p > 0)
phi *= ((d - 1) * pow(d, p - 1));
d++;
if(d * d > n)
d = n;
}
if(cnt == 2)
return copie - 1;
return phi;
}
int main()
{
fin >> n;
for(int i = 1; i <= n; ++i)
{
int ind = indicator_euler(i);
s += ind;
for(int j = i + 1; j <= n; ++j)
if(cmmdc(i, j) == 1)
s++;
}
fout << s;
return 0;
}