上一页 1 ··· 8 9 10 11 12 13 14 15 下一页
摘要: PillsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 42Accepted Submission(s): 36Problem DescriptionAunt Lizzie takes half a pill of a certain medicine every day. She starts with a bottle that contains N pills. On the first day, she removes a ran. 阅读全文
posted @ 2012-03-03 19:02 Stephen Li 阅读(490) 评论(2) 推荐(0)
摘要: Iterated DifferenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 49Accepted Submission(s): 35Problem DescriptionYou are given a list of N non-negative integers a(1), a(2), ... , a(N). You replace the given list by a new list: the k-th entry of t 阅读全文
posted @ 2012-03-03 18:44 Stephen Li 阅读(324) 评论(0) 推荐(0)
摘要: Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:27816Accepted:8556DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 ≤N≤ 100,000) on a number line and the cow is at a p... 阅读全文
posted @ 2012-03-01 21:40 Stephen Li 阅读(212) 评论(0) 推荐(0)
摘要: Help Me with the GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:2157Accepted:1404DescriptionYour task is to read a picture of a chessboard position and print it in the chess notation.InputThe input consists of an ASCII-art picture of a chessboard with chess pieces on positions described b 阅读全文
posted @ 2012-02-28 21:36 Stephen Li 阅读(226) 评论(0) 推荐(0)
摘要: Robot MotionTime Limit:1000MSMemory Limit:10000KTotal Submissions:7311Accepted:3513Description A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are N north (up the page) S . 阅读全文
posted @ 2012-02-27 21:38 Stephen Li 阅读(203) 评论(0) 推荐(0)
摘要: ParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:13696Accepted:8145DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith right p 阅读全文
posted @ 2012-02-27 20:20 Stephen Li 阅读(201) 评论(0) 推荐(0)
摘要: Generate random numbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 114Accepted Submission(s): 44Problem DescriptionJohn von Neumann suggested in 1946 a method to create a sequence of pseudo-random numbers. His idea is known as the "middle 阅读全文
posted @ 2012-02-26 20:18 Stephen Li 阅读(253) 评论(0) 推荐(0)
摘要: Dark roadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 153Accepted Submission(s): 74Problem DescriptionEconomic times these days are tough, even in Byteland. To reduce the operating costs, the government of Byteland has decided to optimize the 阅读全文
posted @ 2012-02-26 20:04 Stephen Li 阅读(504) 评论(1) 推荐(0)
摘要: Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:25461Accepted:10033DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer John ordered a high speed connect 阅读全文
posted @ 2012-02-25 21:10 Stephen Li 阅读(159) 评论(0) 推荐(0)
摘要: Emag eht htiw Em PlehTime Limit:1000MSMemory Limit:65536KTotal Submissions:1695Accepted:1161DescriptionThis problem is a reverse case of theproblem 2996. You are given the output of the problem H and your task is to find the corresponding input.Inputaccording to output ofproblem 2996.Outputaccording 阅读全文
posted @ 2012-02-25 19:50 Stephen Li 阅读(263) 评论(0) 推荐(0)
上一页 1 ··· 8 9 10 11 12 13 14 15 下一页