非常可乐
大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S<101）毫升 >>继续阅读
hdu2612
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
07
11月
2015
Find a way
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.Yifenfei’s home is at the countryside, but Merceki’s home is in the >>继续阅读
uva11624
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
02
11月
2015
Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the maze and which squares of the maze are on fire, you >>继续阅读
fzu2150
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
02
11月
2015
Problem 2150 Fire Game
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 board is consisting of grass or just empty and then they start to fire all the grass. F >>继续阅读
poj3414
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
01
11月
2015
Pots
You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i): fill the poti (1 ≤ i ≤ 2) from the tap; DROP(i): empty the poti to the drain; POUR(i,j): pour from poti to pot j; aft >>继续阅读
poj3087
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
01
11月
2015
Shuffle'm Up
The actual shuffle operation is performed by interleaving a chip from S1 with a chip from S2 as shown below for C = 5:A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by st >>继续阅读
poj1426
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
31
10月
2015
Find The Multiple
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containi >>继续阅读
poj1376
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
30
10月
2015
Robot
The Robot Moving Institute is using a robot in their local store to transport different items. Of course the robot should spend only the minimum time necessary when travelling from one place in the store to another. The robot can move only al >>继续阅读
poj3684
21
10月
2015
Physics Experiment
Simon wants to know where are the N balls after T seconds. Can you help him?Simon is doing a physics experiment with N identical balls with the same radius of R centimeters. Before the experiment, all N balls are fastened within >>继续阅读
poj1190
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
21
10月
2015
生日蛋糕
7月17日是Mr.W的生日，ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕，每层都是一个圆柱体。设从下往上数第i(1 <= i <= M)层蛋糕是半径为Ri, 高度为Hi的圆柱。当i < M时，要求Ri > Ri+1且Hi > Hi+1。由于要在蛋糕上抹奶油，为尽可能节约经费， >>继续阅读
poj2739
15
10月
2015
Sum of Consecutive Prime Numbers
Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two representations 5 + >>继续阅读
poj3421
15
10月
2015
X-factor Chains
Given a positive integer X, an X-factor chain of length m is a sequence of integers, 1 = X0, X1, X2, …, Xm = X satisfying Xi < Xi+1 and Xi | Xi+1 where a | b means a perfectly divides into b. Now we are interested in the maximum >>继续阅读
poj3292
15
10月
2015
Semi-prime H-numbers
An H-number is a positive number which is one more than a multiple of four: 1, 5, 9, 13, 17, 21,... are the H-numbers. For this problem we pretend that these are the only numbers. The H-numbers are closed under multiplication.T >>继续阅读
poj3273
maksyuki 发表于 oj 分类，标签: 数值-二分\三分\折半枚举
15
10月
2015
Monthly Expense
Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi≤ 10,000) that he will need to spend each day ove >>继续阅读
poj3258
maksyuki 发表于 oj 分类，标签: 数值-二分\三分\折半枚举
15
10月
2015
River Hopscotch
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock >>继续阅读
