摘要：
Description众所周知的是，TMK特别容易迟到，终于在TMK某次又迟到了之后，Maple怒了，Maple大喊一声：“我要跟你决一死战！”然后Maple就跟TMK玩起了一个关于占点的游戏。 Maple在一个无限展开的只有整数点的二维平面上找到两个点，由TMK和Maple分别操控... 阅读全文
摘要：
Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the p... 阅读全文
摘要：
设2n张牌分别标记为1, 2, …, n, n+1, …, 2n，初始时这2n张牌按其标号从小到大排列。经一次洗牌后，原来的排列顺序变成n+1, 1, n+2, 2, …, 2n, n。即前n张牌被放到偶数位置2, 4, …, 2n，而后n张牌被放到奇数位置1, 3, …, 2n-1... 阅读全文
摘要：
Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to o... 阅读全文
摘要：
N! (N factorial) can be quite irritating and difficult to compute for large values of N. So instead of calculating N!, I want to know how many... 阅读全文
摘要：
The objective of the program you are going to produce is to evaluate boolean expressions as the one shown next: Expression: ( V | V ) & F & (... 阅读全文
摘要：
ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n × n magic grid on the entrance which is filled with intege... 阅读全文
摘要：
Given the N integers, you have to find the maximum GCD (greatest common divisor) of every possible pair of these integers. Input The first lin... 阅读全文
摘要：
Time Limit: 1000 MS Memory Limit: 131072 K DescriptionThere are two lists and they may be intersected with each other. You must judge if th... 阅读全文
摘要：
Time Limit: 1000 MS Memory Limit: 131072 K DescriptionMisaka Mikoto is a main character of the Animation “To Aru Majutsu no Index” and “To ... 阅读全文