摘要：
定义一个二维数组：int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程... 阅读全文
摘要：
Problem DescriptionThere are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challeng... 阅读全文
摘要：
DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game ... 阅读全文
摘要：
DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four... 阅读全文
摘要：
Sudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cell... 阅读全文
摘要：
You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock.... 阅读全文
摘要：
DescriptionAfter going through the receipts from your car trip through Europe this summer, you realised that the gas prices varied between the cities ... 阅读全文
摘要：
DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and ... 阅读全文
摘要：
题目大意：给了一个2^E的前缀n，已知前缀n的位数不到2^E的位数的一半，找出满足条件的最小E。题目解析：设2^E为i位数，则有n*10^i# include# include# include# includeusing namespace std;void work(unsigned n){ ... 阅读全文
摘要：
题目大意：让求n！在base进制下的位数以及末尾0的连续个数。题目分析：一个m位的b进制数N，最小是b^(m-1)，最大不超过b^m，即b^(m-1)≤N# include# include# include# include# includeusing namespace std;const in... 阅读全文