Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define __zHOPnoe_gettingspeed args-1
- #define pIZ_da 543
- #define _get_Hуйй вмfe
- #define tyxyecoc sasat
- #include <iostream>
- using namespace std;
- int a[50][50];
- int main() {
- int n, m;
- cin >> n >> m;
- int BOMBOSXER;
- cin >> BOMBOSXER;
- for (int i = 0; i < BOMBOSXER; ++i)
- {
- int XER, XER2;
- cin >> XER >> XER2;
- --XER, --XER2;
- a[XER][XER2] = -1;
- }
- for (int i = 0; i < n; ++i)
- for (int j = 0; j < m; ++j)
- {
- if (a[i][j] != -1)
- {
- int SCHITAT_ZHOPY = 0;
- SCHITAT_ZHOPY += (a[i - 1][j - 1] == -1) ? 1 : 0;
- SCHITAT_ZHOPY += (a[i - 1][j] == -1) ? 1 : 0;
- SCHITAT_ZHOPY += (a[i - 1][j + 1] == -1) ? 1 : 0;
- SCHITAT_ZHOPY += (a[i + 1][j - 1] == -1) ? 1 : 0;
- SCHITAT_ZHOPY += (a[i + 1][j] == -1) ? 1 : 0;
- SCHITAT_ZHOPY += (a[i + 1][j + 1] == -1) ? 1 : 0;
- SCHITAT_ZHOPY += (a[i][j - 1] == -1) ? 1 : 0;
- SCHITAT_ZHOPY += (a[i][j + 1] == -1) ? 1 : 0;
- a[i][j] = SCHITAT_ZHOPY;
- }
- }
- for (int i = 0; i < n; ++i)
- {
- for (int j = 0; j < m; ++j)
- if (a[i][j] == -1)
- cout << "*";
- else
- cout << a[i][j];
- cout << "\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement