码农小站

摘要： The Unsolvable ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 486Accepted Submission(s): 280 Problem DescriptionThere are many unsolvable problem in the world.It could be about one or about zero.But this time it is about bigger number. Giv 阅读全文

摘要： UVa 107:http://www.cnblogs.com/lzj-0218/p/3517151.htmlUVa 125:http://www.cnblogs.com/lzj-0218/p/3586634.htmlUVa 147:http://www.cnblogs.com/lzj-0218/p/3554664.htmlUVa 152:http://www.cnblogs.com/lzj-0218/p/3504377.htmlUVa 253:http://www.cnblogs.com/lzj-0218/p/3506856.htmlUVa 348:http://www.cnblogs.com 阅读全文

摘要： English-Number TranslatorIn this problem, you will be given one or more integers in English. Your task is to translate these numbers into their integer representation. The numbers can range from negative 999,999,999 to positive 999,999,999. The following is an exhaustive list of English words that y 阅读全文

摘要： Inglish-Number TranslatorTime Limit:1000MSMemory Limit:65536KTotal Submissions:4183Accepted:1608DescriptionIn this problem, you will be given one or more integers in English. Your task is to translate these numbers into their integer representation. The numbers can range from negative 999,999,999 to 阅读全文

摘要： Gold CoinsTime Limit:1000MSMemory Limit:30000KTotal Submissions:19537Accepted:12169DescriptionThe king pays his loyal knight in gold coins. On the first day of his service, the knight receives one gold coin. On each of the next two days (the second and third days of service), the knight receives two 阅读全文

摘要： Saruman's ArmyTime Limit:1000MSMemory Limit:65536KTotal Submissions:2582Accepted:1284DescriptionSaruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the troops. Each pala 阅读全文

摘要： Best Cow LineTime Limit:1000MSMemory Limit:65536KTotal Submissions:6252Accepted:2010DescriptionFJ is about to take hisN(1 ≤N≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds them past the judges.The contest organ 阅读全文

摘要： Lake CountingTime Limit:1000MSMemory Limit:65536KTotal Submissions:16042Accepted:8118DescriptionDue to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 2 #include 3 4 using namespace std; 5 6 int n,m; 7 char garden[102][102] 阅读全文

摘要： AntsTime Limit:1000MSMemory Limit:30000KTotal Submissions:6418Accepted:3010DescriptionAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they turn back and sta 阅读全文

摘要： Multi-bit TrieTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 180Accepted Submission(s): 56 Problem Description IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a L. 阅读全文

摘要： Balls RearrangementTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1079Accepted Submission(s): 416 Problem Description Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily,. 阅读全文

摘要： ZOJ 1610:http://www.cnblogs.com/lzj-0218/p/3458222.htmlZOJ 3551: http://www.cnblogs.com/lzj-0218/p/3219716.html 阅读全文

摘要： BloodsuckerTime Limit:2 Seconds Memory Limit:65536 KBIn 0th day, there aren-1people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, that is, a people meets a people or a bloodsucker meets a bloodsucker. Otherwise, people may be transf 阅读全文

摘要： 谁是中间的那个TimeLimit: 1 Second MemoryLimit: 64 MegabyteTotalsubmit: 1292 Accepted: 198 Description一天，农夫乔伊像往常一样来到了他的牧场，他突然对他的奶牛产奶量产生了兴趣。他想知道产奶量处于中间的那头奶牛的产奶量是多少，处于中间的意思是说，其中有一半牛的产奶量比它多，另一半牛的产奶量比它少。这个问题现在交由你来写程序完成！Input仅包括一组测试数据，第一行一个正整数N（1 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 l... 阅读全文

摘要： 北师大ACM新手指导/ICPC introduction(1)Time Limit:1000ms Memory Limit:65536KB64-bit integer IO format:%lld Java class name:Main前言/IntroductionEnglish version is available at the bottom. (English descriptions are marked blue.)此题主要是为了对于ACM新队员熟悉和了解ACM竞赛而设置。首先，关于ACM竞赛可以通过点击这里查看：ACM竞赛介绍学校和教务处对于ACM竞赛获奖选手可以在保研中加分. 阅读全文

摘要： Problem:BUN 1001: http://www.cnblogs.com/lzj-0218/p/3200677.htmlContest:第十一届北京师范大学程序设计竞赛: http://www.cnblogs.com/lzj-0218/archive/2013/04/30/3052354.html 阅读全文

摘要： Shoot Accept:7 Submit:7 Time Limit:1000MS Memory Limit:65536KBDescriptionKimi has two types of guns in his gun box. When Kimi use Gun 1 to shoot, there's a probability of p to hit the target. Meanwhile, when he uses Gun 2, the probability of making an accurate shoot becomes q.One day, Kimi went 阅读全文

摘要： Maximum Accept:5 Submit:24 Time Limit:1000MS Memory Limit:65536KBDescriptionDefine f(x) as the number of 1s under base 2. For instance, f(5)=2 for (5)10=(101)2, and f(7)=3 for (7)10=(111)2.Given [A,B], you're required to figure out the maximum f(x) where x is in range [A,B].Input FormatAn intege 阅读全文

摘要： Easy Game Accept:7 Submit:7 Time Limit:1000MS Memory Limit:65536KBDescriptionIt's going to be a very easy game to all of you, and that's why the problem is placed at problem A.There are n coins on the desk. Alice and Bob are taking these coins alternately, and Alice starts first. The rules a 阅读全文

摘要： Largest Square Accept:24 Submit:50 Time Limit:5000MS Memory Limit:65536KB DescriptionGive you a N*N(1≤N≤2000)Square.For each grid in the square,its color is red or black.Your task is to find a largest red square.InputFormatThe first line is an integer T(1≤T≤5) indicating the case number.For each... 阅读全文