#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int a[31][31], b[31][31];
int main()
{
int n, m;
cin >> n >> m;
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
cin >> a[i][j];
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
int l = j, r = j, u = i, d = i, x = a[i][j];
while(l >= 0 && a[i][l] == x) l--;
while(r < m && a[i][r] == x) r++;
while(u >= 0 && a[u][j] == x) u--;
while(d < n && a[d][j] == x) d++;
if(r - l - 1 >= 3|| d - u - 1 >= 3) b[i][j] = 1;
}
}
for(int i = 0; i < n; i++)
{
for(int j = 0; j < m; j++)
{
if(b[i][j]) cout << "0" << " ";
else cout << a[i][j] << " ";
}
cout << endl;
}
return 0;
}
201512-2 消除类游戏
最新推荐文章于 2025-03-18 20:02:11 发布