24h購物| | PChome| 登入
2014-04-18 22:56:27
2013-02-28 09:06:06

[UVA][queue] 12100 - Printer Queue


Problem F - Printer Queue Time limit: 1 second The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the...

2013-02-28 08:16:48

[UVA][遞迴] 12208 - How Many Ones Needed?


To write binary numbers we need only two digits ‘0’ and ‘1’. To write a specific value we need a fixed number of ones, but of course number of zeroes may vary because of leading zeroes. For exa...

2013-02-27 22:52:01

[UVA][?] 12207 - That is Your Queue

Your government has finally solved the problem of universal health care! Now everyone, rich or poor, will finally have access to the same level of medical care. Hurrah! There's one minor co...

2013-02-27 15:35:53

[UVA][運算式] 12392 - Guess the Numbers

Guess the Numbers John has never been very good at maths. Due to his bad grades, his parents have sent him to the Academic Coalition of Mathematics (ACM). Despite the large amount of money his...

2013-02-27 11:44:03

[UVA][單調隊列] 12393 - Non-negative Partial Sums


Non-negative Partial Sums You are given a sequence of n numbers a0,..., an-1. A cyclic shift by k positions ( 0kn - 1) results in the following sequence: ak, ak+1,..., an-1, a0, a1,..., ...

2013-02-27 11:04:28

[UVA][dfs] 12399 - NumPuzz II


Problem C: NumPuzz II We consider again the iPhone game NumPuzz. Please refer to Problem B: NumPuzz I for details of the game. This task may be thought of as the opposite o...

2013-02-27 10:21:57

[UVA][羅馬數字] 12397 - Roman Numerals


Problem A: Roman Numerals We would like to build Roman numerals with matches. As you know, Roman numerals are based on the following seven characters: I, V, X, L, C, D, M. ...

2013-02-26 21:28:16

[UVA][MST] 12507 - Kingdoms


Kingdoms A kingdom has n cities numbered 1 to n, and some bidirectional roads connecting cities. The capital is always city 1. After a war, all the roads of the kingdom are destroyed. The...

2013-02-26 11:51:45

[UVA][math] 11480 - Jimmy's Balls


Problem J Jimmy's Balls Time Limit : 1 second Jimmy has a very large bag full of balls. Each ball has a single color. ...

2013-02-26 08:26:42

[UVA][Trie] 760 - DNA Sequencing

DNA Sequencing A DNA molecule consists of two strands that wrap around each other to resemble a twisted ladder whose sides, made of sugar and phosphate molecules, are connected by rungs o...

2013-02-25 19:38:31

[UVA][多邊形] 11473 - Campus Roads

Problem C Campus Roads Time Limit : 2 seconds NGU has a beautiful campus. The authority of NGU has decided to take some more steps ...

2013-02-24 11:35:53

[UVA][dp] 12131 - Obfuscation

Problem H - Obfuscation Time limit: 5 seconds It is a well-known fact that if you mix up the letters of a word, while leaving the first and last letters in their places, words still remain rea...

2013-02-24 10:08:45

[UVA] 1419 - Ugly Windows


Sheryl works for a software company in the country of Brada. Her job is to develop a Windows operating system. People in Brada are incredibly conservative. They even never use graphical monitors! ...

2013-02-24 09:17:19

[UVA][dp][bitmask] 10149 - Yahtzee

Problem A - Yahtzee The game of Yahtzee involves 5 dice, which are thrown in 13 rounds. A score card contains 13 categories; each round may be scored in a category of the player's choosing, but ...

2013-02-23 21:59:11

[UVA][字串處理][bfs] 10044 - Erdos Numbers

Problem F: Erdös Numbers Background The Hungarian Paul Erdös (1913-1996, speak as ``Ar-dish'') not only was one of the strangest mathematicians of the 20th century, he was also one of...

第一頁      ‹上一頁       51 .  52 .  53 .  54 .  55 .  56 .  57 .  58 .  59 .  60 .      下一頁›      最末頁
«上十頁      第 55 / 142 頁 , 共 2116 筆       下十頁»      
TOP