ZhouRush

find your present (2) Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/1024 K (Java/Others) Total Submission(s): 8161 Accepted Submission(s): 3001 Problem Description In the new year party,

#include #include #include #include using namespace std; const int maxn=30; typedef struct {  int row;  int col; }Matrix; Matrix m[30]; int n; char stra[10*maxn]; int Solve() {  stack par;  stack ms;

http://acm.hdu.edu.cn/showproblem.php?pid=1874 畅通工程续 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12854 Accepted Submission(s): 4363 Problem

http://acm.hdu.edu.cn/showproblem.php?pid=1285 确定比赛名次 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4953 Accepted Submission(s): 1832 Problem

http://acm.hdu.edu.cn/showproblem.php?pid=1269 迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3408 Accepted Submission(s): 1463 Problem De

小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14167 Accepted Submission(s): 4298 Problem Description 上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也

http://acm.hdu.edu.cn/showproblem.php?pid=1010 Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 38218 Accepted Submission(s):

#include #include int a[26][2]; int zhan[1000][2]; int top,sum; int jin(int x) {  zhan[top][0]=a[x][0];  zhan[top][1]=a[x][1];  top++;  return 0; } int chu() {  if(zhan[top-2][1]!=zhan[top-1][0])retur

http://acm.hdu.edu.cn/showproblem.php?pid=2066 一个人的旅行 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9293 Accepted Submission(s): 3176 Problem

Encoding Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13469 Accepted Submission(s): 5722 Problem Description Given a string containing only 'A

http://acm.hdu.edu.cn/showproblem.php?pid=2544   最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13985 Accepted Submission(s): 5961 Problem

http://acm.hdu.edu.cn/showproblem.php?pid=1002 A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 119434 Accepted Submission(s): 22

分拆素数和 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11745 Accepted Submission(s): 5022 http://acm.hdu.edu.cn/showproblem.php?pid=2098 Problem

http://acm.hdu.edu.cn/showproblem.php?pid=2028 Lowest Common Multiple Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17608 Accepted Submiss

http://acm.hdu.edu.cn/showproblem.php?pid=2199 Can you solve this equation? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3094 Accepted Submiss

http://acm.hdu.edu.cn/showproblem.php?pid=1257 最少拦截系统 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7918 Accepted Submission(s): 3066 Problem

#include #include #include using namespace std; struct Node {     int x;     int y; }; int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}}; char map[102][102]; int m,n,step; int ok,sx,sy,ex,ey; int mark[102][10