摘要：
c1=a1，c2=a1+a2，c3=a3，c4=a1+a2+a3+a4，c5=a5，c6=a5+a6，c7=a7，c8=a1+a2+a3+a4+a5+a6+a7+a8，c9=a9，c10=a9+a10，c11=a11........c16=a1+a2+a3+a4+a5+.......+a16。 当 i 为奇数时，ci=ai ；当 i 为偶数时，就要看 i 的因子中最多有二的多少次幂，例如，6 的因子中有 2 的一次幂，等于 2 ，所以 c6=a5+a6（由六向前数两个数的和），4 的因子中有 2 的两次幂，等于 4 ，所以 c4=a1+a2+a3+a4（由四向前数四个数的和）。（一）对于序列a 阅读全文
摘要：
GroupsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 76 Accepted Submission(s): 36 Problem Description After the regional contest, all the ACMers are walking alone a very long avenue to the dining hall in groups. Groups can vary in size for kin. 阅读全文
摘要：
Open-air shopping mallsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1167 Accepted Submission(s): 405 Problem DescriptionThe city of M is a famous shopping city and its open-air shopping malls are extremely attractive. During the tourist season 阅读全文
摘要：
NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1401 Accepted Submission(s): 423 Problem Description Here are two numbers A and B (0 < A <= B). If B cannot be divisible by A, and A and B are not co-prime numbers, we define A as a spec 阅读全文
摘要：
A very hard mathematic problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1685 Accepted Submission(s): 510 Problem Description Haoren is very good at solving mathematic problems. Today he is working a problem like this: Find three positive... 阅读全文
摘要：
首先当然要献上一些非常好的学习资料：基础博弈的小结：http://blog.csdn.net/acm_cxlove/article/details/7854530经典翻硬币游戏小结：http://blog.csdn.net/acm_cxlove/article/details/7854534经典的删边游戏小结：http://blog.csdn.net/acm_cxlove/article/details/7854532五篇国家集训队论文：张一飞： 《由感性认识到理性认识——透析一类搏弈游戏的解答过程 》王晓珂：《 解析一类组合游戏》方展鹏：《浅谈如何解决不平等博弈问题》贾志豪：《组合游戏略述— 阅读全文
摘要：
WordStackTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2605Accepted: 892DescriptionAs editor of a small-town newspaper, you know that a substantial number of your readers enjoy the daily word games that you publish, but that some are getting tired of the conventional crossword puzzles and 阅读全文
摘要：
City MergerTime Limit: 60000ms, Special Time Limit:150000ms, Memory Limit:65536KBTotal submit users: 20, Accepted users: 17Problem 12525 : No special judgementProblem descriptionRecent improvements in information and communication technology have made it possible to provide municipal service to a wi 阅读全文
摘要：
DiaryProblem descriptionNowadays, people who want to communicate in a secure way use asymmetric encryption algorithms such as RSA. However, my older brother uses another, simpler encryption method for his diary entries. He uses a substitution cipher where each letter in the plaintext is substituted 阅读全文
摘要：
Jamie's Contact GroupsTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 5298Accepted: 1682DescriptionJamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list has become so long that it often takes a long 阅读全文