Pagini recente » Cod sursa (job #2630030) | Cod sursa (job #2683130) | Cod sursa (job #2413327) | Cod sursa (job #128490) | Cod sursa (job #1982442)
#include <fstream>
using namespace std;
ifstream fin ("mins.in"); ofstream fout ("mins.out");
const int nmax = 1e6;
int o[nmax + 1];
int main() {
int c, d;
fin >> c >> d;
-- c, -- d;
long long ans = 1LL * c * d;
for (int i = 2; i <= min(c, d); ++ i) {
if (o[ i ] == 1) continue;
int x = (1 - o[ i ]);
for (int j = i; j <= min(c, d); j += i) {
o[ j ] += x;
}
ans -= 1LL * x * (c / i) * (d / i);
}
fout << ans << "\n";
fin.close();
fout.close();
return 0;
}