Cod sursa(job #2949898)
| Utilizator | Data | 2 decembrie 2022 07:03:08 | |
|---|---|---|---|
| Problema | Mins | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("mins.in");
ofstream fout("mins.out");
bool vis[5001][5001];
int main()
{
int n, m;
fin >> n >> m;
n--, m--;
int res = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (vis[i][j] == false)
{
res++;
int k = 1, ni = i, nj = j;
while (ni <= n && nj <= m)
{
vis[ni][nj] = true;
++k;
ni = i * k, nj = j * k;
}
}
fout << res;
return 0;
}