12 2013 档案

摘要:Dating with girls(2)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1812Accepted Submission(s): 505Problem DescriptionIf you have solved the problem Dating with girls(1).I think you can solve this problem too.This problem is also about dating with 阅读全文
posted @ 2013-12-26 15:40 heaventouch 阅读(274) 评论(0) 推荐(0) 编辑
摘要:Tempter of the BoneTime Limit:2 Seconds Memory Limit:65536 KBThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to 阅读全文
posted @ 2013-12-25 21:57 heaventouch 阅读(220) 评论(0) 推荐(0) 编辑
摘要:取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2328Accepted Submission(s): 1328Problem Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个,但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".Input输入有多组.每组第1行是2 8 int 阅读全文
posted @ 2013-12-24 16:37 heaventouch 阅读(243) 评论(0) 推荐(0) 编辑
摘要:Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4118Accepted Submission(s): 2604Problem Description大学英语四级考试就要来临了,你是不是在紧张的复习?也许紧张得连短学期的ACM都没工夫练习了,反正我知道的Kiki和Cici都是如此。当然,作为在考场浸润了十几载的当代大学生,Kiki和Cici更懂得考前的放松,所谓“张弛有道”就是这个意思。 阅读全文
posted @ 2013-12-18 21:41 heaventouch 阅读(284) 评论(0) 推荐(0) 编辑
摘要:Brave GameTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5165Accepted Submission(s): 3420Problem Description十年前读大学的时候,中国每年都要从国外引进一些电影大片,其中有一部电影就叫《勇敢者的游戏》(英文名称:Zathura),一直到现在,我依然对于电影中的部分电脑特技印象深刻。今天,大家选择上机考试,就是一种勇敢(brave)的选择;这个短学期,我们讲的是博弈(game)专题;所以 阅读全文
posted @ 2013-12-18 20:44 heaventouch 阅读(204) 评论(0) 推荐(0) 编辑
摘要:Power StringsTime Limit:3000MSMemory Limit:65536KTotal Submissions:28859Accepted:12045DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplicatio 阅读全文
posted @ 2013-12-18 13:46 heaventouch 阅读(1153) 评论(0) 推荐(0) 编辑
摘要:Play a gameTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1182Accepted Submission(s): 969Problem DescriptionNew Year is Coming!ailyanlu is very happy today! and he is playing a chessboard game with 8600.The size of the chessboard is n*n. A stone i 阅读全文
posted @ 2013-12-17 16:42 heaventouch 阅读(278) 评论(0) 推荐(0) 编辑
摘要: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 阅读(254) 评论(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 阅读(199) 评论(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 阅读(308) 评论(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 阅读(396) 评论(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 阅读(252) 评论(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 阅读(386) 评论(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 阅读(212) 评论(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 阅读(324) 评论(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 阅读(305) 评论(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 阅读(536) 评论(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 阅读(227) 评论(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 阅读(347) 评论(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 阅读(307) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示