加载中
POJ-1021(2D-Nim)

Description The 2D-Nim board game is played on a grid, with pieces on the grid points. On each move, a player may remove any positive number of contiguous pieces in any row or c...

2015/05/12 09:38
29
POJ-1185(炮兵阵地)

Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平...

2015/05/12 09:38
17
POJ-1192(最优连通子集)

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

2015/05/12 09:38
12
POJ-1405(Heritage)

Description Your rich uncle died recently, and the heritage needs to be divided among your relatives and the church (your uncle insisted in his will that the church must get som...

2015/05/12 09:38
14
POJ-3006(Dirichlet's Theorem on Arithmetic Progre)

Description If a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a + 3d, a + 4d, ..., contain...

2015/05/12 09:38
12
POJ-3333(Co-workers from Hell)

Description A watchman has to check a number of chambers in the factory each night according to a schedule which specifies the order in which the chambers must be visited and th...

2015/05/12 09:37
14
POJ-3662(Telephone Lines)

Description Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables required to co...

2015/05/12 09:37
34
POJ-1191(棋盘分割)

Description 将一个8*8的棋盘进行如下分割:将原棋盘割下一块矩形棋盘并使剩下部分也是矩形,再将剩下的部分继续如此分割,这样割了(n-1)次后,连同最后剩下的矩形棋盘共有n块矩形棋盘。(...

2015/05/12 00:10
5
POJ-3749(破译密码)

Description 据说最早的密码来自于罗马的凯撒大帝。消息加密的办法是:对消息原文中的每个字母,分别用该字母之后的第5个字母替换(例如:消息原文中的每个字母A都分别替换成字母F)。而你要...

2015/05/11 23:41
7
2015微软编程之美资格赛

今年参加了2015微软编程之美,下面写下题目和我的答案

POJ-2192(Zipper)

Description Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be m...

2015/05/11 19:14
4
POJ-1396(Simple Arithmetics)

Description One part of the new WAP portal is also a calculator computing expressions with very long numbers. To make the output look better, the result is formated the same way...

2015/05/11 19:12
12
POJ-1061(青蛙的约会)

Description 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件...

2015/05/11 19:09
7
POJ-1014(Dividing)

Description Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be eas...

2015/05/11 19:07
5
POJ-1011(Sticks)

Description George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he...

2015/05/11 19:05
38
POJ-1002(487-3279)

POJ上的题目: Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For ...

2015/05/11 19:01
13
世界名画陈列馆问题(回溯法)

一、算法问题描述: 世界名画陈列馆问题。世界名画陈列馆由m×n个排列成矩形阵列的陈列室组成。为了防止名画被盗,需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室...

2015/04/29 11:56
1K
内存分配(POJ-1193 )

内存是计算机重要的资源之一,程序运行的过程中必须对内存进行分配。 经典的内存分配过程是这样进行的: 1. 内存以内存单元为基本单位,每个内存单元用一个固定的整数作为标识,称为地址。地...

2015/04/18 13:15
22
用Dijkstra算法求解无向图的最短路径

  Dijkstra算法是典型的算法。Dijkstra算法是很有代表性的算法。Dijkstra一般的表述通常有两种方式,一种用永久和临时标号方式,一种是用OPEN, CLOSE表的方式,这里均采用永久和临时标号的...

没有更多内容

加载失败,请刷新页面

没有更多内容

返回顶部
顶部