09 2015 档案

POJ 2236 Wireless Network
摘要：Description：An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers,... 阅读全文
posted @ 2015-09-28 13:31 搁浅の记忆 阅读(160) 评论(0) 推荐(0)
FZU 2150 Fire Game
摘要：Description：Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this ... 阅读全文
posted @ 2015-09-27 11:44 搁浅の记忆 阅读(277) 评论(0) 推荐(0)
HDU 1058 Humble Numbers
摘要：Description：A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18... 阅读全文
posted @ 2015-09-27 10:19 搁浅の记忆 阅读(145) 评论(0) 推荐(0)
UVA 11624 Fire!
摘要：Joe works in a maze. Unfortunately, portions of the maze havecaught on fire, and the owner of the maze neglected to create a fireescape plan. Help Joe... 阅读全文
posted @ 2015-09-26 10:54 搁浅の记忆 阅读(142) 评论(0) 推荐(0)
POJ 1321 棋盘问题
摘要：Description：在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input：输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一... 阅读全文
posted @ 2015-09-25 23:24 搁浅の记忆 阅读(207) 评论(0) 推荐(0)
线性表的基本操作
摘要：1.线性表的顺序表示和实现（顺序表）：#include#define MaxSize 100typedef int DataType;typedef struct //定义结构体Seqlist{ DataType list[MaxSize]; int size;} SeqList;//初... 阅读全文
posted @ 2015-09-25 15:38 搁浅の记忆 阅读(511) 评论(0) 推荐(0)
POJ 3414 Pots（广搜输出路径）
摘要：Description：You are given two pots, having the volume ofAandBliters respectively. The following operations can be performed:FILL(i) fill the poti(1 ≤i... 阅读全文
posted @ 2015-09-24 10:25 搁浅の记忆 阅读(233) 评论(0) 推荐(0)
HDU 1495 非常可乐
摘要：Description:大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S... 阅读全文
posted @ 2015-09-22 11:49 搁浅の记忆 阅读(233) 评论(0) 推荐(0)
POJ 1847 Tram
摘要：Description：Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch po... 阅读全文
posted @ 2015-09-18 12:47 搁浅の记忆 阅读(308) 评论(0) 推荐(0)
POJ 3159 Candies（查分约束）
摘要：Description：During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a ... 阅读全文
posted @ 2015-09-18 12:03 搁浅の记忆 阅读(194) 评论(0) 推荐(0)
POJ 1511 Invitation Cards
摘要：Description：In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want ... 阅读全文
posted @ 2015-09-16 17:27 搁浅の记忆 阅读(164) 评论(0) 推荐(0)
POJ 2240 Arbitrage
摘要：Description：Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same c... 阅读全文
posted @ 2015-09-16 16:31 搁浅の记忆 阅读(219) 评论(0) 推荐(0)
POJ 3660 Cow Contest
摘要：Description：N(1 ≤N≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than othe... 阅读全文
posted @ 2015-09-16 13:00 搁浅の记忆 阅读(110) 评论(0) 推荐(0)
POJ 3259 Wormholes
摘要：Description：While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-... 阅读全文
posted @ 2015-09-16 10:57 搁浅の记忆 阅读(131) 评论(0) 推荐(0)
POJ 1860 Currency Exchange
摘要：Description：Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and perf... 阅读全文
posted @ 2015-09-16 10:45 搁浅の记忆 阅读(136) 评论(0) 推荐(0)
POJ 2387 Til the Cows Come Home
摘要：Description：Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning... 阅读全文
posted @ 2015-09-16 10:30 搁浅の记忆 阅读(128) 评论(0) 推荐(0)
POJ 3268 Silver Cow Party
摘要：Description:One cow from each ofNfarms (1 ≤N≤ 1000) conveniently numbered 1..Nis going to attend the big cow party to be held at farm #X(1 ≤X≤N). A to... 阅读全文
posted @ 2015-09-15 14:35 搁浅の记忆 阅读(144) 评论(0) 推荐(0)
HDU 1030 Delta-wave（找规律）
摘要：Problem Description：A triangle field is numbered with successive integers in the way shown on the picture below.The traveller needs to go from the cel... 阅读全文
posted @ 2015-09-07 22:45 搁浅の记忆 阅读(231) 评论(0) 推荐(0)
HDU 1155 Bungee Jumping（纯物理题）
摘要：Problem Description：Once again, James Bond is fleeing from some evil people who want to see him dead. Fortunately, he has left a bungee rope on a near... 阅读全文
posted @ 2015-09-06 15:47 搁浅の记忆 阅读(238) 评论(0) 推荐(0)
HDU 1272 小希的迷宫
摘要：Problem Description：上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它... 阅读全文
posted @ 2015-09-06 12:43 搁浅の记忆 阅读(150) 评论(0) 推荐(0)
HDU 1024 Max Sum Plus Plus(二维数组转化为一维数组)
摘要：Problem Description：Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more diffi... 阅读全文
posted @ 2015-09-05 23:26 搁浅の记忆 阅读(272) 评论(0) 推荐(0)
HDU 2199 Can you solve this equation?（水题吗？！）
摘要：Problem Description：Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try your lucky.... 阅读全文
posted @ 2015-09-03 22:50 搁浅の记忆 阅读(211) 评论(1) 推荐(0)
HDU 1176 免费馅饼(简单DP，数塔变形)
摘要：Problem Description：都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小... 阅读全文
posted @ 2015-09-03 10:46 搁浅の记忆 阅读(212) 评论(0) 推荐(0)
HDU 1711 Number Sequence(KMP模板)
摘要：Problem Description:Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 const int N=1000010;int a[N], b[10010... 阅读全文
posted @ 2015-09-01 13:00 搁浅の记忆 阅读(143) 评论(0) 推荐(0)