原创 HDU 4403(Aeroplane chess ,求期望,概率DP)

Aeroplane chess Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Descript

原创 HDU4282 A very hard mathematic problem(二分搜索)

A very hard mathematic problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

原创 UVA 10452 Marcus, help!( DFS )

Problem I Marcus, help! Input: standard inputOutput: standard output Time Limit: 2 Seconds "First, the breath of God

原创 UVA 536 Tree Recovery(由前序中序求後序,經典)

 Tree Recovery Time Limit: 3000 MS Little Valentine liked playing with binary trees very much. Her favorite game w

原创 The Stern-Brocot Number System(排序二叉樹)

The Stern-Brocot Number System Input: standard input Output: standard output   The Stern-Brocot tree is a beautiful

原创 UVA 439 Knight Moves(BFS)

 Knight Moves From:UVA, 439 Time Limit: 3000 MS A friend of you is doing research on the Traveling Knight Problem

原创 UVA 120 Stacks of Flapjacks(翻煎餅,啦啦啦啦~)

Problem A : Stacks of Flapjacks Background Stacks and Queues are often considered the bread and butter of dat

原创 HDU 1253 勝利大逃亡(三維BFS)

勝利大逃亡 Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Description Ignatius被魔王抓走了,

原创 HDU 1242 Rescue(求最短時間救出同伴,BFS+DP)

Rescue Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Description Angel was c

原创 HDU 1072 Nightmare( 身上帶有定時炸彈的他能否在炸彈爆炸之前離開—— BFS+DP思想)

Nightmare Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Description Ignatius h

原创 HDU 1312 Red and Black (BFS)

Red and Black Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Descr

原创 POJ 2051 Argus(按週期輸出)

Argus Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 9674   Accepted: 4509 Description A data str

原创 UVA10336 Rank the Languages(DFS)

Problem A Rank the Languages Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB

原创 POJ 1936 All in All(string)

All in All Time Limit: 1000MS   Memory Limit: 30000K       Description You have devised a new encryption techniq

原创 UVA 146 ID code(next_permutation的運用)

ID code It is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise gre