Cod sursa(job #2849332)
| Utilizator | Data | 14 februarie 2022 21:54:36 | |
|---|---|---|---|
| Problema | Mins | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("mins.in");
ofstream fout("mins.out");
#define MAXN 1000005
int v[MAXN];
int main()
{
int c, d, i, j;
fin >> c >> d;
long long sol = 0, x;
i = 2;
while(i <= min(c - 1, d - 1))
{
x = 1 - v[i];
sol += x * ((c - 1)/ i) * ((d - 1) / i);
for(j = 2 * i; j <= min(c - 1, d - 1); j += i)
v[j] += x;
i++;
}
fout << (long long)((c - 1) * (d - 1) - sol);
return 0;
}
