- 博客(3)
- 收藏
- 关注
RSS订阅原创 BFS 走迷宫代码
//代码如下#include #include using namespace std;#define Max 105const int INF=10000000;typedef pair P;char maze[Max][Max];int sx, sy;int gx, gy;int n, m;int d[Max][Max];int dx
2015-07-14 15:59:50
507
原创 Avangard Latin Squares
#include using namespace std;#define Max 1002int cell[Max][Max];void solve(int n){ int i, j; int col,row; if((n>1 && n printf("Yes\n"); for(i=1; i printf(
2015-07-13 17:25:16
311
转载 Hdu 1006 Tick and Tick
Tick and TickTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14607 Accepted Submission(s): 3354Problem DescriptionThe three h
2015-07-12 10:03:30
225
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人