Cod sursa(job #3185051)
Utilizator | Andrei Sebastian Dragulescu AnSeDra | Data | 17 decembrie 2023 18:29:31 |
---|---|---|---|
Problema | Mins | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
const int Nmax = 1000005;
int ciur[Nmax];
int main(){
ifstream fin("mins.in");
ofstream fout("mins.out");
int n, m, x;
long long sol;
fin >> n >> m;
n--; m--;
sol = 0;
for(int i = 2; i <= min(n, m); i++){
x = ciur[i] - 1;
if(x == 0){
continue;
}
sol -= 1LL * x * (n / i) * (m / i);
for(int j = i; j <= min(n, m); j += i){
ciur[j] -= x;
}
}
fout << 1LL * n * m - sol;
return 0;
}