摘要:
http://poj.org/problem?id=2996 1 #include 2 #include 3 char map[55][55]; 4 void find1(char ch) 5 { 6 int flag = 0; 7 for (int i = 15; i >= 1; i -= 2) 8 { 9 if (flag)10 break;11 for (int j = 2; j <= 30; j += 4)12 {13 if (map[i][j]==ch)14 ... 阅读全文
posted @ 2013-08-07 19:18
N_ll
阅读(162)
评论(0)
推荐(0)

浙公网安备 33010602011771号