新聞| | PChome| 登入
2014-04-18 22:56:27
2012-12-26 22:12:35

[UVA][stack] 12582 - Wedding of Sultan

題目意思:給定一個圖的走訪方式(dfs),問每個節點的 degree。解法:既然原本 dfs 是用 stack 去寫,那麼還原也是 stack 去模擬。第一次遇到的字母 = push()第二次遇到的字...

2012-12-26 21:39:01

[UVA] 12583 - Memory Overflow

題目意思:這個人只能記住前 k 天的人,而他每天只會遇到一個人,如果不認識的話,他會把他記住,但是在 k 天後遺忘,如果再次遇到的話,就在延長時間。問 他有幾天可以認識到他認識的人。// 英文原題就不...

2012-12-26 20:31:37

[UVA][bfs] 11624 - Fire!

Problem B: Fire! Joe works in a maze. Unfortunately, portions of the maze have caught on fire...

2012-12-26 19:19:32

[UVA][spfa] 11280 - Flying to Fredericton


Problem C FLYING TO FREDERICTON After being inspired by Salvador Dali's artwork, Brett decided...

2012-12-25 21:47:22

[UVA] 11804 - Argentina

A Argentina The Argentine football team coach, the great Diego Marad...

2012-12-24 17:11:44

[UVA] 11403 - Binary Multiplication


Problem: I Binary Multiplication All of us know simple multiplication...

2012-12-24 16:16:44

[UVA][dp] 11032 - Function Overloading

Problem F Function Overloading Time limit: 1 second ...

2012-12-24 08:40:20

[UVA][parse] 11878 - Homework Checker

Homework Checker � Your younger brother has just finished his homework for the part "additions a...

2012-12-23 22:22:50

[UVA] 1189 - Find The Multiple


Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal rep...

2012-12-23 19:38:43

[UVA][二分搜+KMP] 12467 - Secret Word

Problem G. Secret word Alicia and Roberto like to play games. Today, Roberto ...

2012-12-23 18:52:40

[UVA][分數循環] 10555 - Dead Fraction


Problem B: Dead Fraction Mike is frantically scrambling to finish his thesis at the last minute. ...

2012-12-23 12:04:56

[JAVA][Thread] 試寫


做個糞作來玩玩。Demo 影片:http://www.youtube.com/watch?v=bahAEMYQr5o&feature=youtu.beimport javax.swing.*;...

2012-12-22 20:06:15

[2012/12/22] 紀錄


我變得廢物之前,我想盡可能留下點紀錄。我說過我以後可能不會幹這一行,真的是很有可能的。

2012-12-22 17:14:08

[UVA][dp] 11569 - Lovely Hint

Problem E: Lovely Hint Jay and Kay decide to play a game. They write an English sente...

2012-12-22 16:19:39

[UVA][dp] 11552 - Fewest Flops

Problem F FEWEST FLOPSA common way to uniquely encode a string is by replacing its consecutive repea...

第一頁      ‹上一頁       61 .  62 .  63 .  64 .  65 .  66 .  67 .  68 .  69 .  70 .      下一頁›      最末頁
«上十頁      第 62 / 142 頁 , 共 2116 筆       下十頁»      
TOP