hihocoder#1094 Lost in the City
2015-03-22 21:09
417 查看
#include using namespace std; int main(void) { int i, j, n, m; char map[222][222], b[11][11]; cin>>n>>m; for(i = 1; i <= n; i++) for(j = 1; j <= m; j++) cin>>map[j]; for(i = 1; i <= 3; i++) for(j = 1; j <= 3; j++) cin>>b[i][j]; for(i = 2; i < n; i++) for(j = 2; j < m; j++) if(map[i][j] == b[2][2]) { if(map[i - 1][j - 1] == b[1][1] && map[i - 1][j] == b[1][2] && map[i - 1][j + 1] == b[1][3] && map[i][j + 1] == b[2][3] && map[i + 1][j + 1] == b[3][3] && map[i + 1][j] == b[3][2] && map[i + 1][j - 1] == b[3][1] && map[i][j - 1] == b[2][1]) cout <[i]
相关文章推荐
- HIHOCODER#1094 : Lost in the City
- hihoCoder#1094 Lost in the City
- 【hihocoder】1094. lost in the City
- 【hihocoder】#1094 : Lost in the City
- hiho #1094 : Lost in the City
- hihocoder 1094 : Lost in the City
- #1094 : Lost in the City
- hihocoder #1094 : Lost in the City
- hihoCoder题库1094Lost in the City
- #1094 Lost in the City
- #1094 : Lost in the City 找到几个当年c语言留下的坑
- [HIHO1094]Lost in the City(暴力、枚举)
- #1094 : Lost in the City(测试用例正确,但提交显示WA,求发现我程序错误)
- hihocoder #1094 : Lost in the City微软苏州校招笔试 12月27日 (建图不大【暴力枚举】 子图的4种形态 1Y )
- #1094 : Lost in the City
- hihoCoder #1094 : Lost in the City
- #1094 : Lost in the City 找到几个当年c语言留下的坑
- #1094 : Lost in the City
- hihocoder #1094 : Lost in the City
- hihocoder-#1094 : Lost in the City