Pagini recente » Cod sursa (job #1665848) | Cod sursa (job #92816) | Cod sursa (job #1346241) | Cod sursa (job #2022744) | Cod sursa (job #2938830)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("mins.in");
ofstream fout("mins.out");
const int VMAX = 1e6;
int mob[VMAX + 1];
void buildMob(int n) {
mob[0] = mob[1] = 1;
for(int i = 2; i <= n; i++) {
if(mob[i] == 0) { // i este prim
mob[i] = -1;
for(int j = i + i; j <= n; j += i) {
if(mob[j] == 0) {
mob[j] = -1;
} else {
mob[j] = -mob[j];
}
}
}
}
for(int i = 2; i * i <= n; i++) {
mob[i * i] = 0;
}
for(int i = 2; i <= n; i++) {
if(mob[i] == 0) {
for(int j = i + i; j <= n; j += i) {
mob[j] = 0;
}
}
}
}
int main() {
int c, d;
fin >> c >> d;
if(c < d) {
swap(c, d);
}
buildMob(VMAX);
long long ans = 0;
for(int i = 1; i < d; i++) {
ans += mob[i] * ((long long) (c - 1) / i) * ((long long) (d - 1) / i);
}
fout << ans << '\n';
return 0;
}