Cod sursa(job #2961467)
| Utilizator | Data | 6 ianuarie 2023 15:41:49 | |
|---|---|---|---|
| Problema | Mins | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("mins.in");
ofstream g("mins.out");
const int NrMax = 1000005;
long long n, m, nr[NrMax], x, cnt;
int main()
{
f >> n >> m;
n --; m --;
for(int i = 2; i <= min(n, m); i ++)
{
x = nr[i] - 1;
cnt -= x * (n / i) * (m / i);
for(int j = i; j <= min(n, m); j += i)
nr[j] -= x;
}
g << n * m - cnt;
return 0;
}
