poj1251

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

ungle Roads

The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expen >>继续阅读

poj1220

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

NUMBER BASE CONVERSION

Write a program to convert numbers in one base to numbers in a second base. There are 62 different digits:{ 0-9,A-Z,a-z }HINT: If you make a sequence of base conversions using the output of >>继续阅读

poj1218

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

THE DRUNK JAILER

A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.One night, the jailer gets bored and decides to play a game. For round 1 of the game, he takes >>继续阅读

poj1195

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

Mobile phones

Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns >>继续阅读

poj1182

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

食物链

动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。

现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。

有人用两种说法对这N个动物所构成的食物链关系进行描述:

第一种说法是"1 X Y",表示X和Y是同类。 >>继续阅读

poj1163

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

The Triangle

Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either >>继续阅读

poj1157

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

LITTLE SHOP OF FLOWERS

You want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being of a different kind, and at least as many vases ordered in a row. The vases are glued onto the shelf and are >>继续阅读

poj1151

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

Atlantis

There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps describe different >>继续阅读

poj1149

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

PIGS

Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to some pig-houses and wants to buy a cert >>继续阅读

poj1144

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

Network

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines are bidirectional and always connect together >>继续阅读

poj1135

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

Domino Effect

Did you know that you can use domino bones for other things besides playing Dominoes? Take a number of dominoes and build >>继续阅读

poj1125

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

Stockbroker Grapevine

Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge >>继续阅读

poj1122

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

FDNY to the Rescue!

The Fire Department of New York (FDNY) has always been proud of their response time to fires in New York City, but they want to make their response time even better. To help them >>继续阅读

poj1088

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

滑雪

Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡 >>继续阅读

poj1068

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

Parencodings

Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: >>继续阅读

poj1067

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

取石子游戏

有两堆石子,数量任意,可以不同。游戏开始由两个人轮流取石子。游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子;二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目,如果轮到你先取,假设双方都采取最好的策略,问最后你是胜者还是败者。 >>继续阅读