24h購物| | PChome| 登入
2014-04-18 22:56:27

[公告] 搬家至另一個地方

2012-07-17 08:54:50

[UVA] 10191 - Longest Nap

Problem D: Longest Nap The Problem As you may already know, there are professors very busy with a filled schedule of work during the day. Your professor, let's call him Professor P, is a bit ...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-17 08:33:07

[UVA] 538 - Balancing Bank Accounts


Balancing Bank Accounts Once upon a time there was a large team coming home from the ACM World Finals. The fifteen travellers were confronted with a big problem: In the previous wee...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-16 17:08:04

[UVA][耐心] 403 - Postscript


Postscript The year is 1976 and a small upstart company has just invented the first (albeit crude) laser postscript printer. They have hired you to write Release 1 of the the postscript print...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-16 15:42:45

[UVA] 161 - Traffic Lights

Traffic Lights One way of achieving a smooth and economical drive to work is to `catch' every traffic light, that is have every signal change to green as you approach it. One day you notice as yo...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-16 08:12:22

[UVA] 630 - Anagrams (II)

Anagrams (II) One of the preferred kinds of entertainment of people living in final stages of XX century is filling in the crosswords. Almost every newspaper and magazine has a column dedicat...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-16 07:47:04

[UVA] 454 - Anagrams

Anagrams An anagram is a word or phrase formed by rearranging the letters of another word or phrase. For example, ``carthorse" is an anagram of ``orchestra". Blanks within a phrase are ignored i...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-16 07:33:49

[UVA][dfs] 148 - Anagram checker

Anagram checker It is often fun to see if rearranging the letters of a name gives an amusing anagram. For example, the letters of `WILLIAM SHAKESPEARE' rearrange to form `SPEAK REALISM AWHILE'. ...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-15 10:14:15

[UVA][linked list] 245 - Uncompress


Uncompress A simple scheme for creating a compressed version of a text file can be used for files which contain no digit characters. The compression scheme requires making a list of the words i...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-15 09:24:55

[UVA] 213 - Message Decoding


Message Decoding Some message encoding schemes require that an encoded message be sent in two parts. The first part, called the header, contains the characters of the message. The second part...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-15 07:46:46

[UVA][dfs, 窮舉] 140 - Bandwidth


Bandwidth Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then the bandwidth of a node v is defined as the maximum distance in ...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-14 09:13:55

[UVA] 10693 - Traffic Volume


Problem F Traffic Volume Input: standard input Output: standard output Time Limit: 1 second In the picture below (or above depending on HTML response :)) you can see a street. It has infin...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-14 08:54:30

[UVA][Math] 10666 - The Eurocup is Here!


The Eurocup is Here! Background We are the champions of the Eurocup! Well... almost. Actually, we lost in first round and didn't win any match. But we were beaten by the re...
繼續閱讀...

回應(3)| 推薦(0)| 收藏(0)| UVA
2012-07-14 08:34:48

[UVA][Math] 10509 - R U Kidding Mr. Feynman?


Problem AR U Kidding Mr. Feynman?Input: Standard InputOutput: Standard OutputRichard P. Feynman was amusician, artist, scientist, teacher and Nobel lauriet. He contributed to the developmentof the ato...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-14 07:48:44

[UVA][Java] 11821 - High-Precision Number


Problem D High-Precision Number Input: Standard Input Output: Standard Output A number with 30 decimal digits of precision can be represented by a structure type as shown in the exampl...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
2012-07-14 07:07:56

[UVA][D&C] 1230 - MODEX

Many well-known cryptographic operations require modular exponentiation. That is, given integers x , y and n , compute xy mod n . In this question, you are tasked to program an efficient way to...
繼續閱讀...

回應(0)| 推薦(0)| 收藏(0)| UVA
第一頁      ‹上一頁       81 .  82 .  83 .  84 .  85 .  86 .  87 .  88 .  89 .  90 .      下一頁›      最末頁
«上十頁      第 82 / 142 頁 ， 共 2116 筆       下十頁»      
TOP