poj2195

maksyuki 发表于 oj 分类,标签:
0
poj2195

Going Home

On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to pay a $1 travel fee for every step >>继续阅读

poj3422

maksyuki 发表于 oj 分类,标签:
0
poj3422

Kaka's Matrix Travels

On an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix travels with SUM = 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bottom one, taking care that the rook move >>继续阅读

poj3308

maksyuki 发表于 oj 分类,标签: ,
0
poj3308

Paratroopers

It is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in the m × n grid >>继续阅读

poj3436

maksyuki 发表于 oj 分类,标签:
0
poj3436

ACM Computer Factory

As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at the same factory. >>继续阅读

poj2391

maksyuki 发表于 oj 分类,标签: , ,
0
poj2391

Ombrophobic Bovines

FJ's cows really hate getting wet so much that the mere thought of getting caught in the rain makes them shake in their hooves. They have decided to put a rain siren on the farm to let them know when rain is approaching. They in >>继续阅读

poj1087

maksyuki 发表于 oj 分类,标签:
0
poj1087

A Plug for UNIX

You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the free flow of information and ideas on the Internet as cumbersom >>继续阅读

poj2112

maksyuki 发表于 oj 分类,标签: ,
0
poj2112

Optimal Milking

FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milking machines. The milking machine locations >>继续阅读

poj2337

maksyuki 发表于 oj 分类,标签:
0
poj2337

Catenyms

A catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms:

dog.gopher gopher.rat rat.tiger aloha.aloha arachnid.do >>继续阅读

poj3169

maksyuki 发表于 oj 分类,标签:
0
poj3169

Layout

Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows are standing in the same order as they are num >>继续阅读

poj2607

maksyuki 发表于 oj 分类,标签:
0
poj2607

Fire Station

A city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest station is too far, so a new station is to be built. You are to choose the location of the fire station so >>继续阅读

poj1192

maksyuki 发表于 oj 分类,标签:
0
poj1192

最优连通子集

众所周知,我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示,如果x, y都是整数,我们就把点P称为整点,否则点P称为非整点。我们把平面上所有整点构成的集合记为W。 >>继续阅读

poj1613

maksyuki 发表于 oj 分类,标签:
0
poj1613

Cave Raider

Afkiyia is a big mountain. Inside the mountain, there are many caves. These caves are connected by tunnels. Hidden in one of the caves is a terrorist leader. Each tunnel connects two caves. There could be more than one tunnels connect t >>继续阅读

poj3026

maksyuki 发表于 oj 分类,标签:
0
poj3026

Borg Maze

The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg individual is linked to the c >>继续阅读

poj3687

maksyuki 发表于 oj 分类,标签:
0
poj3687

Labeling Balls

Windy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in such a way that:

1. No two balls share the same label. >>继续阅读

poj1128

maksyuki 发表于 oj 分类,标签: ,
0
poj1128

Frame Stacking

Consider the following 5 picture frames placed on an 9 x 8 array.Now place them on top of one another starting with 1 at the bottom and ending up with 5 on top. If any part of a frame covers another it hides that part of the frame be >>继续阅读

poj1094

maksyuki 发表于 oj 分类,标签:
0
poj1094

Sorting It All Out

An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D implies that A < B, B < C >>继续阅读