摘要：
N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6493Accepted Submission(s): 2951Problem Descr... 阅读全文
posted @ 2013-12-16 21:05
heaventouch
阅读(260)
评论(0)
推荐(0)
摘要：
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58461Accepted Submission(s): 15902Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, 阅读全文
posted @ 2013-12-14 20:47
heaventouch
阅读(203)
评论(0)
推荐(0)
摘要：
Open the LockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3388Accepted Submission(s): 1499Problem DescriptionNow an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.Ea 阅读全文
posted @ 2013-12-14 12:29
heaventouch
阅读(314)
评论(0)
推荐(0)
摘要：
Musical ThemeTime Limit:1000MSMemory Limit:30000KTotal Submissions:16162Accepted:5577DescriptionA musical melody is represented as a sequence of N (1 23 #include 24 #define N 20005 25 int wa[N],wb[N],ws[N],wv[N],wd[N]; 26 int rank[N],height[N]; 27 int Max(int a,int b) 28 { 29 return a>b?a:b; 30 . 阅读全文
posted @ 2013-12-14 11:17
heaventouch
阅读(402)
评论(0)
推荐(0)
摘要：
Red and BlackTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7328Accepted Submission(s): 4585Problem DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. Fro 阅读全文
posted @ 2013-12-11 22:51
heaventouch
阅读(263)
评论(0)
推荐(0)
摘要：
Knight MovesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5296Accepted Submission(s): 3234Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves th 阅读全文
posted @ 2013-12-10 12:54
heaventouch
阅读(391)
评论(0)
推荐(0)
摘要：
A strange liftTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9424Accepted Submission(s): 3562Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 13 #include14 #define N 20515 usin 阅读全文
posted @ 2013-12-10 11:37
heaventouch
阅读(219)
评论(0)
推荐(0)
摘要：
RescueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12927Accepted Submission(s): 4733Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M 12 #include13 #include14 using name 阅读全文
posted @ 2013-12-09 19:26
heaventouch
阅读(327)
评论(0)
推荐(0)
摘要：
Boring countingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1331Accepted Submission(s): 538Problem Description035 now faced a tough problem,his english teacher gives him a string,which consists with n lower case letter,he must figure out how man 阅读全文
posted @ 2013-12-09 19:21
heaventouch
阅读(309)
评论(0)
推荐(0)
摘要：
Cable masterTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1428Accepted Submission(s): 522Problem DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised 阅读全文
posted @ 2013-12-03 15:52
heaventouch
阅读(546)
评论(0)
推荐(0)
摘要：
KingTime Limit:1000MSMemory Limit:10000KTotal Submissions:9331Accepted:3478DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound king.'' After nine months her child was born, and indeed, sh 阅读全文
posted @ 2013-12-01 22:59
heaventouch
阅读(236)
评论(0)
推荐(0)
摘要：
Integer IntervalsTime Limit:1000MSMemory Limit:10000KTotal Submissions:12192Accepted:5145DescriptionAn integer interval [a,b], a 16 #include17 #include18 #define N 1000519 #define inf 0x7ffffff20 using namespace std;21 struct node{22 int s,e;23 }edge[N];24 int d[N];25 int n,up,down;26 void bellm... 阅读全文
posted @ 2013-12-01 22:22
heaventouch
阅读(352)
评论(0)
推荐(0)
摘要：
LayoutTime Limit:1000MSMemory Limit:65536KTotal Submissions:5955Accepted:2842DescriptionLike everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 =d 6 求点1到点n的最长距离，无限远输出-2，不存在输出-1 7 8 差分约束： 9 对差分约束有一定的了解了，不过最大的问题还是在构图上，因为构图错了好几次。10 1... 阅读全文
posted @ 2013-12-01 12:09
heaventouch
阅读(312)
评论(0)
推荐(0)
摘要：
THE MATRIX PROBLEMTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6380Accepted Submission(s): 1633Problem DescriptionYou have been given a matrix CN*M, each element E of CN*Mis positive and no more than 1000, The problem is that if there exist N nu 阅读全文
posted @ 2013-11-30 12:00
heaventouch
阅读(289)
评论(0)
推荐(0)
摘要：
Is the Information Reliable?Time Limit:3000MSMemory Limit:131072KTotal Submissions:10303Accepted:3204DescriptionThe galaxy war between the Empire Draco and the Commonwealth of Zibu broke out 3 years ago. Draco established a line of defense called Grot. Grot is a straight line withNdefense stations. 阅读全文
posted @ 2013-11-29 09:46
heaventouch
阅读(275)
评论(0)
推荐(0)
浙公网安备 33010602011771号