24h購物| | PChome| 登入
2014-04-18 22:56:27
2012-06-01 19:50:12

[UVA][floyd-warshall][difficult] 125 - Numbering Paths


Numbering Paths Background Problems that process input and generate a simple ``yes'' or ``no'' answer are called decision problems. One class of decision problems, the NP-complete problems, a...

2012-06-01 17:50:01

[UVA][spfa] 104 - Arbitrage


Arbitrage Background The use of computers in the finance industry has been marked with controversy lately as programmed trading -- designed to take advantage of extremely small fluctuations in...

2012-05-31 08:11:28

[ACM-ICPC][樹形DP] 2038 - Strategic game


Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a mediev...

2012-05-31 07:31:32

[UVA][幾何] 11343 - Isolated Segments

D - Isolated Segments Time Limit: 1 sec Memory Limit: 16MB You're given n segments in the rectangular coordinate system. The segments are defined by start and end points (Xi,Yi) and (Xj,Y...

2012-05-31 07:30:02

[UVA][幾何] 191 - Intersection


Intersection You are to write a program that has to decide whether a given line segment intersects a given rectangle. An example: line: start point: (4,9) end point: (11,2...

2012-05-30 21:29:40

[ITSA][DP][15th 精] Problem 4. Group without direct leaders

Problem 4. Group without direct leaders(Time Limit: 5 seconds)Problem DescriptionIn X company, everyone, except the CEO, has a direct leader. There are n persons in the company and everyone has a uniq...

2012-05-30 08:23:50

[UVA][模擬] 118 - Mutant Flatworld Explorers

Mutant Flatworld Explorers Background Robotics, robot motion planning, and machine learning are areas that cross the boundaries of many of the subdisciplines that comprise Computer Science: ar...

2012-05-30 07:45:22

[UVA] 12149 - Feynman


Richard Phillips Feynman was a well known American physicist and a recipient of the Nobel Prize in Physics. He worked in theoretical physics and also pioneered the field of quantum computing. He ...

2012-05-30 07:42:20

[UVA] 11063 - B2-Sequence

Problem H - B2-Sequence Time Limit: 1 second A B2-Sequence is a sequence of positive integers 1 ≤ b1 < b2 < b3 ... such that all pairwise sums bi + bj, where i ≤ j, are different. ...

2012-05-30 07:03:07

[UVA][Greedy] 10718 - Bit Mask

Problem A Bit Mask Time Limit 1 Second In bit-wise expression, mask is a common term. You can get a certain bit-pattern using mask. For example, if you want to make first...

2012-05-30 06:39:21

[UVA][DP] 10404 - Bachet's Game


Problem B: Bachet's Game Bachet's game is probably known to all but probably not by this name. Initially there are n stones on the table. There are two players Stan and Ollie, who move altern...

2012-05-30 06:22:57

[UVA] 10700 - Camel trading

Problem E - Camel tradingTime Limit: 1 secondBackgroundAroud 800 A.D., El Mamum, Calif of Baghdad was presented the formula1+2*3*4+5, which had its origin in the financial accounts of a cameltransacti...

2012-05-30 06:08:52

[UVA] 10684 - The jackpot

Problem D - The jackpot Time Limit: 1 second Memory Limit: 1 Mb Background As Manuel wants to get rich fast and without too much work, he decided to make a career in gambling. Initia...

2012-05-29 21:43:39

[a462] Beats of the Angel


內容 : AB國是一個非常不一樣的國家,在這個國家裡面的人民,他們沒有壽命限制、受傷再嚴重只要時間夠久也能夠恢復、甚至當身體灰飛煙滅後,人民也能從某個固定點復活,彷彿線上遊戲般砍掉也能重練。但也...

2012-05-29 17:19:05

[UVA][BFS] 352 - The Seasonal War

The Seasonal War The inhabitants of Tigerville and Elephantville are engaged in a seasonal war. Last month, Elephantville successfully launched and orbited a spy telescope called the Bumble Scope...

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