poj1751

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1751

HighwaysThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a number of highways connecting some of >>继续阅读

poj1738

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1738

An old Stone Game

There is an old stone game.At the beginning of the game the player picks n(1<=n<=50000) piles of stones in a line. The goal is to merge the stones in one pile observing the following rules:

At each step of the game,the pla >>继续阅读

poj1703

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1703

Find them, Catch them

The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. >>继续阅读

poj1700

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1700

Crossing River

A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross >>继续阅读

poj1679

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1679

The Unique MST

Given a connected undirected graph, tell if its minimum spanning tree is unique. >>继续阅读

poj1659

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1659

Frogs' Neighborhood

未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名湖)，每个湖泊Li里住着一只青蛙Fi(1 ≤ i ≤ N)。如果湖泊Li和Lj之间有水路相连，则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1, x2, ..., xn，请你给出每两个湖泊之间的相连关系。

Input

第一行是测试数据的组数T(0 ≤ T ≤ 20)。每组数据包括两行， >>继续阅读

poj1651

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1651

Multiplication Puzzle

The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the >>继续阅读

poj1617

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1617

Crypto Columns

The columnar encryption scheme scrambles the letters in a message (or plaintext) using a keyword as illustrated in the following example: Suppose BATBOY is the keyword and our message is MEET ME BY THE OLD OAK TREE. Since the keyword >>继续阅读

poj1603

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1603

Risk

Risk is a board game in which several opposing players attempt to conquer the world. The gameboard consists of a world map broken up into hypothetical countries. During a player's turn, armies stationed in one country are only allowed to attac >>继续阅读

poj1573

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1573

Robot Motion

A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are >>继续阅读

poj1562

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1562

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

poj1555

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1555

Polynomial Showdown

Given the coefficients of a polynomial from degree 8 down to 0, you are to format the polynomial in a readable format with unnecessary characters removed. For instance, given the coefficients 0, 0, 0, 1, 22, -333, 0, 1, and -1, >>继续阅读

poj1546

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1546

Basically Speaking

The Really Neato Calculator Company, Inc. has recently hired your team to help design their Super Neato Model I calculator. As a computer scientist you suggested to the company that it would be neato if this new calculator could >>继续阅读

poj1528

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1528

Perfection

From the article Number Theory in the 1994 Microsoft Encarta: If a, b, c are integers such that a = bc, a is called a multiple of b or of c, and b or c is called a divisor or factor of a. If c is not 1/-1, b is called a proper divisor of >>继续阅读

poj1523

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1523

SPF

Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network >>继续阅读

poj1511

maksyuki 发表于 oj 分类，标签:
15 9月 2015
0
poj1511

Invitation Cards

In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. >>继续阅读

返回首页 上一页 1617181920 下一页 最后一页