剑不飞

摘要： Complete the SequenceTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 161 Accepted Submission(s): 93Problem DescriptionYou probably know those quizzes in Sunday magazines: given the sequence 1, 2, 3, 4, 5, what is the next number? Sometimes it is v 阅读全文

摘要： Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6244 Accepted Submission(s): 3137Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes 阅读全文

摘要： B - Checkout AssistantCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 19BDescriptionBob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is de 阅读全文

摘要： PeriodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1543 Accepted Submission(s): 746Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whethe 阅读全文

摘要： E - Flag 2Crawling in process...Crawling failedTime Limit:2000MS Memory Limit:131072KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 18EDescriptionAccording to a new ISO standard, a flag of every country should have, strangely enough, a chequered fieldn × m, each square should 阅读全文

摘要： D - Seller BobCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:131072KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 18DDescriptionLast year Bob earned by selling memory sticks. During each of n days of his work one of the two following events took place: A custo 阅读全文

摘要： D - Two PathsCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 14DDescriptionAs you know, Bob's brother lives in Flatland. In Flatland there are n cities, connected by n - 1 two-way roads. The cities are num 阅读全文

摘要： C - Four SegmentsCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 14CDescriptionSeveral months later Alex finally got his brother Bob's creation by post. And now, in his turn, Alex wants to boast about some 阅读全文

摘要： E - CamelsCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 14EDescriptionBob likes to draw camels: with a single hump, two humps, three humps, etc. He draws a camel by connecting points on a coordinate plane. N 阅读全文

摘要： A + B Problem TooTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8373 Accepted Submission(s): 6277Problem DescriptionThis problem is also a A + B problem,but it has a little difference,you should determine does (a+b) could be divided with 86.For e 阅读全文