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

[UVA] 11475 - Extend to Palindrome

Problem E Extend to Palindromes Time Limit : 3 seconds Your task is, given an integer N, to make a palidrome (word that read...

2012-02-22 07:19:35

[UVA] 10298 - Power Strings

Problem D: Power Strings Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplica...

2012-02-22 07:06:46

[UVA] 455 - Periodic Strings

Periodic Strings A character string is said to have period k if it can be formed by concatenating one or more repetitions of another string of length k. For example, the string "abcabcabcabc" h...

2012-02-18 14:31:01

[UVA] 10020 - Minimal coverage

Minimal coverage The Problem Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover the seg...

2012-01-31 14:08:01

[JAVA][作業練習] Lab8

抽象類別的實作練習程式碼 :下載

2012-01-30 13:05:17
2012-01-30 12:45:36

[2012/1/30]


開工就到這了, UVa 洗垃圾題就會洗到累, 格式真是挺麻煩的, 暫時不動工了,200 題, 真的是算少了 !

2012-01-29 21:37:15

[UVA] 11284 - Shopping Trip


Problem G SHOPPING TRIP For some reason, Daniel loves to collect and watch operas on DVD. He can find and order all the operas he wants from Amazon, and they will even deliver them right to his...

2012-01-29 16:52:06

[UVA] 10496 - Collecting Beepers [TSP][DP]

Problem E Collecting Beepers Input: standard input Output: standard output Time Limit: 2 seconds Karel is a robot who lives in a rectangular coordinate system where each place is designated by...

2012-01-29 14:35:19

[UVA] 471 - Magic Numbers


Magic Numbers Write a program that finds and displays all pairs of integers and such that: neither nor have any digits repeated; and , where N is a given integer; Input and Outpu...

2012-01-29 13:32:59

[UVA] 10706 - Number Sequence

Problem B Number Sequence Input: standard input Output: standard output Time Limit: 1 second A single positive integer i is given. Write a program to find the digit located in the positio...

2012-01-29 12:41:42

[UVA] 10943 - How do you add?


Problem A: How do you add? Larry is very bad at math - he usually uses a calculator, which worked well throughout college. Unforunately, he is now struck in a deserted island with his good bud...

2012-01-29 10:40:30

[UVA] 11631 - Dark roads [Kruskal]

Problem D: Dark roads Economic times these days are tough, even in Byteland. To reduce the operating costs, the government of Byteland has decided to optimize the road lighting. Till now every ...

2012-01-29 09:52:17

[UVA] 908 - Re-connecting Computer Sites

Problem D Re-connecting Computer Sites Consider the problem of selecting a set T of high-speed lines for connecting N computer sites, from a universe of M high-speed lines each connect...

2012-01-29 09:11:50

[UVA] 10034 - Freckles

Problem D Re-connecting Computer Sites Consider the problem of selecting a set T of high-speed lines for connecting N computer sites, from a universe of M high-speed lines each connect...

第一頁      ‹上一頁       111 .  112 .  113 .  114 .  115 .  116 .  117 .  118 .  119 .  120 .      下一頁›      最末頁
«上十頁      第 112 / 142 頁 , 共 2116 筆       下十頁»      
TOP