摘要：
Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 #includeint dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};int mm[105][105],a[105][105];int n,k;int dfs(int x,int y){ if(mm[x][y]>0) return 阅读全文
