摘要:
#include int map[11][11]; int book[11][11]; int top; int f=0,n,m; struct hh { int x; int y; }hh[100]; void gjx(int x,int y,int jinshuikou) { if(x==n && y==m+1) { f=1; ... 阅读全文
posted @ 2016-09-14 16:24
MichaelOD
阅读(479)
评论(0)
推荐(0)