随笔分类 - BFS
摘要:Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17930 Accepted Submis
阅读全文
摘要:Y2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:9632Accepted:4806DescriptionAccounting for Computer Machinists (ACM) has suffe...
阅读全文
摘要:非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4142Accepted Submission(s): 1691Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S13 #
阅读全文
摘要:逃离迷宫Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12910Accepted Submission(s): 3090Problem Description 给定一个m × n (m行, n列)的迷宫,迷宫中有两个位置,gloria想从迷宫的一个位置走到另外一个位置,当然迷宫中有些地方是空地,gloria可以穿越,有些地方是障碍,她必须绕行,从迷宫的一个位置,只能走到与它相邻的4个位置中,当然在行走过程中,gloria不能走到迷宫
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文
摘要: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
阅读全文