## uva524

maksyuki 发表于 oj 分类，标签:

A ring is composed of n (even number) circles as shown in diagram. Put natural numbers 1, 2, . . . , n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. Note: the number of first circle should always be 1. >>继续阅读

## uva10976

maksyuki 发表于 oj 分类，标签:

It is easy to see that for every fraction in the form 1/k(k > 0), we can always find two positive integers x and y, x ≥ y, such that: 1/k= 1/x + 1/y

Now our question is: can you write a program that counts how many such pairs of x and y there ar >>继续阅读

## uva11059

maksyuki 发表于 oj 分类，标签:

Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of the maximum positive product involving consecutive terms of S. If you cannot find a positive sequence, you should consider 0 as the value of the maximum >>继续阅读

## uva725

maksyuki 发表于 oj 分类，标签:

Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first number divided by the second is equal to an integer N, where 2 ≤ N ≤ 79. That is,

abcde / fghij = N, wh >>继续阅读

## uva10562

maksyuki 发表于 oj 分类，标签:

Professor Homer has been reported missing. We suspect that his recent research works might have had something to with this. But we really don’t know much about what he was working on! The detectives tried to hack into his computer, but after hours of >>继续阅读

## uva10129

maksyuki 发表于 oj 分类，标签:

Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important for us.

There is a large number of magneti >>继续阅读

## uva10305

maksyuki 发表于 oj 分类，标签:

John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been executed.

Input

The input will consist of several instances of the problem. Each instance begins >>继续阅读

## uva816

maksyuki 发表于 oj 分类，标签:

The 1999 World Finals Contest included a problem based on a dice maze. At the time the problem was written, the judges were unable to discover the original source of the dice maze concept. Shortly after the contest, however, Mr. Robert Abbott, the cr >>继续阅读

## uva1103

maksyuki 发表于 oj 分类，标签:

In order to understand early civilizations, archaeologists often study texts written in ancient languages. One such language, used in Egypt more than 3000 years ago, is based on characters called hieroglyphs. In this problem, you will write a program >>继续阅读

## uva572

maksyuki 发表于 oj 分类，标签:

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 a grid that divides the land into numerous square plots. It then analyze >>继续阅读

## uva297

maksyuki 发表于 oj 分类，标签:

A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be split in four sub quadrants, etc. In the quadtree, the image is repre >>继续阅读

## uva699

maksyuki 发表于 oj 分类，标签:

Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing happened to binary trees, how large would the piles >>继续阅读

## uva839

maksyuki 发表于 oj 分类，标签:

Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found hanging over cradles of small babies.

The figure illustrates a simple mobile. >>继续阅读

## uva548

maksyuki 发表于 oj 分类，标签:

You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum of values of nodes along that path.

Input

The i >>继续阅读

## uva122

maksyuki 发表于 oj 分类，标签:

Trees are fundamental in many branches of computer science (Pun definitely intended). Current stateof-the art parallel computers such as Thinking Machines’ CM-5 are based on fat trees. Quad- and octal-trees are fundamental to many algorithms in compu >>继续阅读

## uva679

maksyuki 发表于 oj 分类，标签:

A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-terminal node. It then keeps moving down, either follows the path of the left subtree, or follows the p >>继续阅读