Cod sursa(job #1456685)
| Utilizator | Data | 1 iulie 2015 17:47:01 | |
|---|---|---|---|
| Problema | Mins | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
# include <bits/stdc++.h>
using namespace std;
ifstream fi("mins.in");
ofstream fo("mins.out");
bitset < 10005 > s[10005];
int main(void)
{
int n,m;
fi>>n>>m;
--n;--m;
for (int i = 1;i <= n;++i)
for (int j = 1;j <= m;++j) s[i][j] = 1;
int ans = 0;
for (int i = 1;i <= n;++i)
for (int j = 1;j <= m;++j)
if (s[i][j])
{
++ans;
int x = i,y = j;
while (x <= n && y <= m) s[x][y] = 0,x += i,y += j;
}
return fo << ans << '\n',0;
}
