逆风的方向 更适合飞翔

Thrall’s DreamTime Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述We never paid any heed to the ancient prophecies, like fools we clung to the old hatreds, and fought as we had for

RescueProblem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is:

Easy FindingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16482 Accepted: 4476DescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), co

Problem Descriptionshadow来到一片神奇的土地，这片土地上不时会出现一些有价值的水晶，shadow想要收集一些水晶带回去，但是这项任务太繁杂了，于是shadow让自己的影子脱离自己并成为一个助手来帮助自己收集这些水晶。shadow把这片土地划分成n*m个小方格，某些格子会存在一些shadow和他的影子都无法穿越的障碍，比如巨石、树木、野兽等。shadow预先探测到

Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 941    Accepted Submission(s): 352Problem Description《Journey to t

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 77763 Accepted: 28905DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或

Wang Xifeng's Little PlotProblem Description《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16202 Accepted: 4349DescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), could you find some ro

Generalized Palindromic NumberTime Limit: 2 Seconds      Memory Limit: 65536 KBA number that will be the same when it is written forwards or backwards is known as a palindromic number. For e

A very hard Aoshu problemProblem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary school students. T

Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 29921 Accepted: 12975DescriptionFlip game is played on a rectangular 4x4 field with two-sided

解题思路：记忆化搜索

胜利大逃亡Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟

RescueProblem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: a

Catch That CowProblem DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number li

Robot MotionProblem DescriptionA 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

Prime Ring ProblemProblem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10647    Accepted Submission(s): 6179Problem DescriptionThe GeoSurvC

BalloonsTime Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of peop

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23268    Accepted Submission(s): 10363Problem DescriptionA ring

本题用到了递归，一遇到递归就头疼，不知道递归到哪里去了。针对该题，我把N=4的情况，把递归完全跑了一遍，在纸上画来画去，终于对该题递归的过程有了一定的理解。在递归的同时也进行回溯。下面代码中行数和列数均是从0开始的。这里写思路为了好理解，我们认为行数和列数均是从1开始的。整体思路是一行一行的放，在每一行中一列一列的放。这里的n设为4，先放第一行，从第一列开始，外层一个循环，从第1列到第n列......

Find a wayTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3238    Accepted Submission(s): 1051Problem DescriptionPass a year lea

Ignatius and the Princess ITime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 3Special JudgeFont: Times