宫村优子 -- It's only the fairy tale

 
It's only the fairy tale  
只是传说
 
Who are those little girls in pain?   
那些正在痛苦的小女孩是谁?
Just trapped in castle of dark side of moon  
她们被捕获到月亮背面的黑暗城堡
Twelve of them shining bright in vain  
这十二个小女孩徒然地放出光彩
Like flowers that blossom just once in years  
像数年才绽放一次的花朵般
 
They're dancing in the shadow like whispers of love  
她们在阴影下如同那爱的低语般舞动着
Just dreaming of place where they're free as dove  
在梦中的他们才像鸽子般自由
They’ve never been allowed to love in this cursed cage  
在被诅咒的牢笼中他们永远不被允许去爱
It’s only the fairy tale they believe  
他们相信这只是传说
阅读更多

Chemfrog's Fairy Tale

08-20

Because of the evil wizard's curse, Chemfrog became a frog. Luckily, he met Cyjj. She told him that he could become a handsome boy again if he found the pretty princess and got her kiss. But the princess was captured by the evil wizard, and she was enjailed in the XiaoYingzhou in the West Lake.nnChemfrog bought a West Lake map. He found that the West Lake was in a regular shape as the picture1 shown below. So he marked the center of the lake to be (0, 0), and the northmost point to be (0, N), the southmost point to be (0, -N), the eastmost point to be (N, 0), the westmost point to be (-N, 0). Then he could marked the position of XiaoYingzhou with P(px, py).nnnpicture 1: suppose N is 5nnTime and tide wait for no one. Chemfrog jumped into the West Lake immediately, and went forward to P. When he arrived at the position (x0, y0), he felt something strange: he could not move freely! That's because the evil wizard detected his action and bewitched the West Lake. Chemfrog realized the problem soon, and he also found the jumping rule to fight against the bewitchery:nnRule 1: jumping like the Knight in Chess.nRule 2: jumping without falling back.nRule 3: jumping within the West Lake.nnPicture 2 and Picture 3 show the Rules:nnnpicture 2nnnpicture 3nnNote: if chemfrog jumped to the point marked blue from the yellow point, the next jump he could choose 5 point marked green, but the black ones and the yellow one were forbidden.nnSo Chemfrog jumped to (x1, y1) from (x0, y0). The evil wizard would not await his doom, and he flew to the West Lake to prevent Chemfrog to meet the princess. It's supposed that Chemfrog must jump onto the XiaoYingzhou within M jumps.nnIs it possible for Chemfrog to meet the princess? Now it's turn for you to calculate whether Chemfrog could meet the pretty girl successfully. If it is possible, output the minimum number of jumping.nnInput:nnThe input will consist of several test cases. The first line of each test case is two nonnegative number, said N (2<=N<=500) and M (0

换一批

没有更多推荐了,返回首页