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

[UVA][Sort&Search] 10125 - Sumsets

Problem C - Sumsets Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S. Input Several S, each consisting of a line contai...

2012-03-23 21:30:22

[UVA][Math] 10994 - Simple Addition


Problem E Simple Addition Input: Standard Input Output: Standard Output Let’s define a simple recursive function F (n), where Let’s define another function S (p, q), ...

2012-03-23 17:25:35

[UVA] 10699 - Count the factors

Problem D - Count the factors Time Limit: 1 second The Problem Write a program, that computes the number of different prime factors in a positive integer. The Input ...

2012-03-23 17:20:20

[UVA] 10189 - Minesweeper

Problem B: Minesweeper The Problem Have you ever played Minesweeper? It's a cute little game which comes within a certain Operating System which name we can't really remember. Well, the goal...

2012-03-23 17:17:04

[UVA][Math] 10242 - Fourth Point !!

Problem G Fourth Point!! Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB Given are the (x, y) coordinates of the endpoints of two adjacent ...

2012-03-23 12:20:52

[UVA][LIS&LDS] 10131 - Is Bigger Smarter?

Question 1: Is Bigger Smarter? The Problem Some people think that the bigger an elephant is, the smarter it is. To disprove this, you want to take the data on a collection of elephants and p...

2012-03-19 14:12:40

[UVA] 621 - Secret Research


Secret Research At a certain laboratory results of secret research are thoroughly encrypted. A result of a single experiment is stored as an information of its completion: `posit...

2012-03-19 13:51:22

[UVA][DP] 674 - Coin Change

Coin Change Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money. For exam...

2012-03-18 23:52:26

[UVA] 686 - Goldbach's Conjecture (II)

Goldbach's Conjecture (II) Goldbach's Conjecture: For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that n = p1 + p2. ...

2012-03-18 23:42:22

[UVA] 694 - The Collatz Sequence

The Collatz Sequence An algorithm given by Lothar Collatz produces sequences of integers, and is described as follows: Step 1: Choose an arbitrary positive integer A as the first item in th...

2012-03-18 17:49:47

[UVA] 846 - Steps


Steps One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the leng...

2012-03-16 22:08:49

[UVA] 1260 - Sales


Mr. Cooper, the CEO of CozyWalk Co., receives a report of daily sales every day since the company has been established. Starting from the second day since its establishment, on receiving the repor...

2012-03-16 21:52:29

[UVA][D&C] 10006 - Carmichael Numbers


Carmichael NumbersAn important topic nowadays in computer science is cryptography. Some people even thinkthat cryptography is the only important field in computer science, and thatlife would not matte...

2012-03-16 17:25:53

[UVA][BFS] 572 - Oil Deposits


Oil Deposits The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates ...

2012-03-16 11:39:27

[UVA][ConvexHull] 218 - Moth Eradication


Moth EradicationEntomologists in the Northeast have set out traps to determine the influx of Jolliet moths into the area. They plan to study eradication programs that have some potential to control th...

第一頁      ‹上一頁       101 .  102 .  103 .  104 .  105 .  106 .  107 .  108 .  109 .  110 .      下一頁›      最末頁
«上十頁      第 109 / 142 頁 , 共 2116 筆       下十頁»      
TOP