Cod sursa(job #2955346)
Utilizator | Chiriac Andrei chiriacandrei25 | Data | 16 decembrie 2022 19:38:34 |
---|---|---|---|
Problema | Mins | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
const int Nmax = 1000005;
int cnt[Nmax];
int main() {
int n, m;
ifstream fin("mins.in");
ofstream fout("mins.out");
fin >> n >> m;
n--; m--;
long long nr = 0;
for(int i = 2; i <= min(n, m); i++) {
// cnt[i] = de cate ori am adunat (Mi, Mi) la 'solutie'
int x = cnt[i] - 1;
nr -= 1LL * x * (n / i) * (m / i);
for(int j = i; j <= min(n, m); j += i) {
cnt[j] -= x;
}
}
fout << 1LL * n * m - nr;
return 0;
}