24h購物| | PChome| 登入
2014-04-18 22:56:27
2012-05-03 22:35:39

[UVA] 12439 - February 29

G February 29 It is 2012, and it's a leap year. So there is a "February 29" in this year, which is called leap day. Interesting thing is the infant who will born in thi...

2012-05-03 22:17:18

[UVA][zkw式] 100 - The 3n + 1 problem


The 3n + 1 problem Background Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be anal...

2012-05-03 21:43:28

[UVA][ST] 100 - The 3n + 1 problem


The 3n + 1 problem Background Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be anal...

2012-05-03 18:29:56

[UVA][Normal] 490 - Rotating Sentences

Rotating Sentences In ``Rotating Sentences,'' you are asked to rotate a series of input sentences 90 degrees clockwise. So instead of displaying the input sentences from left to right and top to b...

2012-05-03 17:23:29

[UVA][EASY] 445 - Marvelous Mazes

Marvelous Mazes Your mission, if you decide to accept it, is to create a maze drawing program. A maze will consist of the alphabetic characters A-Z, * (asterisk), and spaces. Input and Output...

2012-05-03 17:04:58

[UVA][EASY] 11577 - Letter Frequency


Problem A: Letter Frequency In this problem we are interested in the frequency of letters in a given line of text. Specifically, we want to know the most frequently occurring letter(s) in the t...

2012-05-03 15:33:02

[HTML] CSS: Coding with Style


External Style SheetsLet's finish this section with a little interactivity.Find the rule you built for the a element in the previous exercise and copy the whole thing, selector, braces, declaration an...

2012-05-03 15:28:49

[HTML] CSS: Coding with Style


Precision Targeting with Classes and Selectors To finish this section, let's learn some shorthand. A few declarations can be collapsed into just one declaration. Instead of individually setting ...

2012-05-03 08:57:31

[UVA][SSSP] 10986 - Sending email

Problem E Sending email Time Limit: 3 seconds "A new internet watchdog is creating a stir in Springfield. Mr. X, if that is his real name, has come up with a sensational scoop." Kent...

2012-05-03 06:55:08

[UVA][DP] 825 - Walking on the Safe Side


Walking on the Safe Side Square City is a very easy place for people to walk around. The two-way streets run North-South or East-West dividing the city into regular blocks. Most street intersecti...

2012-05-02 08:13:45

[UVA][Trie] 902 - Password Search

Problem C Password Search Being able to send encoded messages during World War II was very important to the Allies. The messages were always sent after being encoded with a known password...

2012-05-02 07:52:01

[UVA][Map] 902 - Password Search

Problem C Password Search Being able to send encoded messages during World War II was very important to the Allies. The messages were always sent after being encoded with a known password...

2012-05-02 06:51:38

[UVA][Math] 10223 - How many nodes ?

How many nodes ? The Problem One of the most popular topic of Data Structures is Rooted Binary Tree. If you are given some nodes you can definitely able to make the maximum number of ...

2012-05-02 06:37:46

[UVA][Java][Math] 10303 - How Many Trees?

Problem D How Many Trees? Input: standard input Output: standard output Memory Limit: 32 MB A binary search tree is a binary tree with root k such that any node v in the left subtr...

2012-05-01 21:08:00

[UVA] 11349 - Symmetric Matrix


J - Symmetric Matrix Time Limit: 1 sec Memory Limit: 16MB You`re given a square matrix M. Elements of this matrix are Mij: {0 < i < n, 0 < j < n}. In this problem you'll have to ...

第一頁      ‹上一頁       91 .  92 .  93 .  94 .  95 .  96 .  97 .  98 .  99 .  100 .      下一頁›      最末頁
«上十頁      第 99 / 142 頁 , 共 2116 筆       下十頁»      
TOP