poj3040

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

Allowance

As a reward for record milk production, Farmer John has decided to start paying Bessie the cow a small weekly allowance. FJ has a set of coins in N (1 <= N <= 20) different >>继续阅读

poj3187

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

Backward Digit Sums

FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. They repeat this until only >>继续阅读

poj1966

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

Cable TV Network

The interconnection of the relays in a cable TV network is bi-directional. The network is connected if there is at least one interconnection path between each pair of relays present in the network. Otherwise the network is disconne >>继续阅读

poj2125

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

Destroying The Graph

Alice and Bob play the following game. First, Alice draws some directed graph with N vertices and M arcs. After that Bob tries to destroy it. In a move he may take any vertex of the graph and remove either all arcs incoming int >>继续阅读

poj2175

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

Evacuation Plan

The City has a number of municipal buildings and a number of fallout shelters that were build specially to hide municipal workers in case of a nuclear war. Each fallout shelter has a limited capacity in terms of a number of people i >>继续阅读

poj2516

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

Minimum Cost

Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places (marked from 1 to M), each provides K >>继续阅读

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 >>继续阅读