Bomb
Problem Description
The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. >>继续阅读
BestCoder Round #64(Div.2) (3/4) (Div.1) (2/4)
maksyuki 发表于 比赛 分类，标签: 比赛-bestcoder
30
11月
2015
A Numbers
Problem Description
There is a number N.You should output "YES" if N is a multiple of 2, 3 or 5,otherwise output "NO". >>继续阅读
hdu1011
28
11月
2015
Starship Troopers
Problem Description
You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is >>继续阅读
Codeforces Round #333(Div.2) (5/5) (Div.1) (3/5)
maksyuki 发表于 比赛 分类，标签: 比赛-codeforces
25
11月
2015
A Two Bases
After seeing the "ALL YOUR BASE ARE BELONG TO US" meme for the first time, numbers X and Y realised that they have different bases, which complicated their relations. >>继续阅读
hdu2844
24
11月
2015
Coins
Problem Description
Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice >>继续阅读
hdu1171
23
11月
2015
Big Event in HDU
Problem Description
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into >>继续阅读
hdu1203
23
11月
2015
I NEED A OFFER!
Problem Description
Speakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱， >>继续阅读
poj2229
23
11月
2015
Sumsets
Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that sum to 7:
1) 1+1+1+1+1+1+1 >>继续阅读
hdu1284
23
11月
2015
hdu2159
22
11月
2015
FATE
Problem Description
最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是， >>继续阅读
BestCoder Round #63(Div.2) (4/4) (Div.1) (3/4)
maksyuki 发表于 比赛 分类，标签: 比赛-bestcoder
21
11月
2015
A sequence1
Problem Description
Given an array a with length n, could you tell me how many pairs (i,j) ( i < j ) for abs(ai−aj) mod b=c.
Input >>继续阅读
hdu1260
15
11月
2015
Tickets
Problem Description
Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.A good a >>继续阅读
hdu1176
15
11月
2015
免费馅饼
Problem Description
都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。 >>继续阅读
hdu1257
11
11月
2015
最少拦截系统
Problem Description
某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天, >>继续阅读
Codeforces Round #329(Div.2) (2/5)
maksyuki 发表于 比赛 分类，标签: 比赛-codeforces
08
11月
2015
A 2Char
Andrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of >>继续阅读
poj3279
maksyuki 发表于 oj 分类，标签: 基础算法-搜索(DFS\BFS)\记忆化
08
11月
2015
Fliptile
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15) of square tiles, each of which is col >>继续阅读