【搜索、递推、树】
zthgreat
这个人很懒,什么都没有留下
展开
-
hdu 1501 Zipper
ZipperTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6825 Accepted Submission(s): 2457Problem DescriptionGiven three strings原创 2014-09-05 20:19:20 · 475 阅读 · 0 评论 -
zoj 1136 Multiple
a program that, given a natural number N between 0 and 4999 (inclusively), and M distinct decimal digits X1,X2..XM (at least one), finds the smallest strictly positive multiple of N that has no othe原创 2014-09-18 22:16:21 · 641 阅读 · 0 评论 -
zoj 1091 Knight Moves
A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessb原创 2014-09-18 20:42:28 · 589 阅读 · 0 评论 -
hdu 1010 Tempter of the Bone
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 71708 Accepted Submission(s): 19747Problem DescriptionThe原创 2014-09-07 20:09:12 · 434 阅读 · 0 评论 -
hdu 1015 Safecracker
SafecrackerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8611 Accepted Submission(s): 4347Problem Description=== Op tech br原创 2014-09-08 13:56:20 · 458 阅读 · 0 评论 -
hdu 1241 Oil Deposits
Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12303 Accepted Submission(s): 7151Problem DescriptionThe GeoSurvC原创 2014-08-25 15:55:25 · 428 阅读 · 0 评论 -
hdu 2717 Catch That Cow
Catch That CowTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7203 Accepted Submission(s): 2274Problem DescriptionFarmer John原创 2014-08-25 23:57:07 · 471 阅读 · 0 评论 -
hdu 2952 Counting Sheep
Counting SheepTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2066 Accepted Submission(s): 1363Problem DescriptionA while ago原创 2014-08-25 16:21:28 · 419 阅读 · 0 评论 -
hdu 2614 Beat
BeatTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 602 Accepted Submission(s): 390Problem DescriptionZty is a man that alway原创 2014-08-26 18:28:06 · 372 阅读 · 0 评论 -
zoj 1649 Rescue
RescueTime Limit: 2 Seconds Memory Limit: 65536 KBAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to sa原创 2014-09-10 20:42:50 · 522 阅读 · 0 评论 -
hdu 5012 Dice
DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 154 Accepted Submission(s): 89Problem DescriptionThere are 2 special dice原创 2014-09-14 20:22:04 · 549 阅读 · 0 评论 -
poj 1166 The Clocks
Description|-------| |-------| |-------|| | | | | | ||---O | |---O | | O || | | | | ||-------| |-------| |-------|原创 2014-11-07 19:36:35 · 710 阅读 · 0 评论 -
poj 1011 Sticks
DescriptionGeorge 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 forgot how many sti原创 2014-11-08 00:00:23 · 550 阅读 · 0 评论 -
poj 1915 Knight Moves
DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? The Problem Your ta原创 2014-10-23 14:06:28 · 529 阅读 · 0 评论 -
UESTC 853 一个简单的走迷宫问题
这是一个网格迷宫问题,地图的左上角为(0,0),坐标(i,j)表示i行j列。有一个人,他在一个迷宫里,他要去一个目标位置。他站在网格的交叉点上,障碍物在网格内部。他可以用不同的速度前进,每秒可以走1格到3格。也可以花费一秒的时间向左或向右转。同时他不能撞到障碍物,也不能半个身体在地图外面。现在,他最短要多少秒才能走到目标位置。人的体积是一个半径为0.5格的圆。Input题目有多原创 2014-11-10 13:45:27 · 1134 阅读 · 0 评论 -
poj 1129 Channel Allocation
DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each r原创 2014-10-24 22:52:41 · 799 阅读 · 0 评论 -
UESTC 408 STAMPS // poj 1010
Have you done any Philately lately?You have been hired by the Ruritanian Postal Service (RPS) to design their new postage software. The software allocates stamps to customers based on customer needs原创 2014-11-10 16:19:05 · 763 阅读 · 0 评论 -
wikioi 2549 自然数和分解
题目描述 Description把自然数N分解为若干个自然数之和,输出方案数。输入描述 Input DescriptionN,(1≤n≤50)输出描述 Output Description方案数样例输入 Sample Input5样例输出 Sample Output7原创 2014-10-08 23:17:25 · 932 阅读 · 0 评论 -
poj 2386 Lake Counting
DescriptionDue to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains原创 2014-10-27 16:36:38 · 429 阅读 · 0 评论 -
hdu 1026 Ignatius and the Princess I
Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrint原创 2014-10-29 13:17:48 · 511 阅读 · 0 评论 -
UESTC 解救小Q
小Q被邪恶的大魔王困在了迷宫里,love8909决定去解救她。 迷宫里面有一些陷阱,一旦走到陷阱里,就会被困身亡:(,迷宫 里还有一些古老的传送阵,一旦走到传送阵上,会强制被传送到 传送阵的另一头。现在请你帮助love8909算一算,他至少需要走多少步才能解 救到小Q?Input第一行为一个整数T,表示测试数据组数。每组测试数据第一行为两个整数N,M,(1≤N,M≤50原创 2014-10-30 15:59:55 · 1159 阅读 · 0 评论 -
poj 1256 Anagram
DescriptionYou are to write a program that has to generate all possible words from a given set of letters. Example: Given the word "abc", your program should - by exploring all different combina原创 2014-11-15 15:22:04 · 712 阅读 · 0 评论 -
UESTC 方老师与素数
方老师最近很喜欢素数,他想玩一个游戏:现在有两个4位的素数n和m,你一次可以改变n的一位数字,并且改变过后的新数字必须也是个素数,并且也不能有前导0。请问使n变为m最少需要多少步。例如n=1033 m=8179那么可行的变化是:1033173337333739377987798179Input第一行有一个整数T(T≤100),代表测试数据的组数。原创 2014-10-30 17:17:33 · 541 阅读 · 0 评论 -
poj 3083 Children of the Candy Corn
DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terro原创 2014-10-15 22:10:43 · 458 阅读 · 0 评论 -
poj 2488A Knight's Journey
DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a knight moves, it is t原创 2014-10-14 19:09:34 · 468 阅读 · 0 评论 -
UESTC 方老师与迷宫
方老师被困在了一个3维的迷宫中,他很想逃离这个迷宫回去玩炉石传说,你能帮助他么?Input多组测试数据,对于每组测试数据,有三个整数 L,R,C(0l,r,c≤30)。L代表迷宫的高度,R和C分别代表每一层的行和列。接下来是L个R×C的矩阵,矩阵包含4种字符(S,E,.,#),S代表方老师的初始位置,E代表出口,#代表障碍。.代表能通过的地方。每一层之后有一个空行。原创 2014-11-01 23:55:33 · 596 阅读 · 0 评论 -
hdu 2545 树上战争
树上战争Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 538 Accepted Submission(s): 287Problem Description给一棵树,如果树上的某个节点被某个人占据,则原创 2014-08-24 15:58:41 · 492 阅读 · 0 评论 -
UESTC 方老师开橙卡
方老师开橙卡Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Submit Status方老师最近迷上了炉石传说,但是他总是被土豪吊打。方老师是万能的,他知道如何能开出橙卡:方老师有一个幸运数字n,他开卡包的时候总会在屏幕上划出一个原创 2014-11-04 19:47:02 · 964 阅读 · 0 评论 -
hdu 2563 统计问题
统计问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5282 Accepted Submission(s): 3098Problem Description在一无限大的二维平面中,我们做如下假设:原创 2014-08-25 14:04:25 · 416 阅读 · 0 评论 -
hdu 2064 汉诺塔III
汉诺塔IIITime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9310 Accepted Submission(s): 4170Problem Description约19世纪末,在欧州的商店中出售一种智原创 2014-08-05 15:08:27 · 555 阅读 · 0 评论 -
hdu 1249 三角形
三角形Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4794 Accepted Submission(s): 3277Problem Description用N个三角形最多可以把平面分成几个区域?原创 2014-08-03 15:43:00 · 397 阅读 · 0 评论 -
poj 1979Red and Black
Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 22435 Accepted: 12117DescriptionThere is a rectangular room, covered with square tiles. E原创 2014-08-17 19:50:50 · 509 阅读 · 0 评论 -
hdu 2067 小兔的棋盘
小兔的棋盘Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6295 Accepted Submission(s): 3418Problem Description小兔的叔叔从外面旅游回来给她带来了一个礼原创 2014-08-05 16:58:39 · 413 阅读 · 0 评论 -
hdu 1143 Tri Tiling
Tri TilingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2125 Accepted Submission(s): 1215Problem DescriptionIn how many way原创 2014-08-01 22:04:16 · 355 阅读 · 0 评论 -
hdu1016 Prime Ring Problem
素数环原创 2014-06-25 23:45:10 · 428 阅读 · 0 评论 -
hdu1045 Fire Net
Problem DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A block原创 2014-11-06 22:38:14 · 466 阅读 · 0 评论 -
Codeforces Round #277.5 (Div. 2) D - Unbearable Controversy of
D. Unbearable Controversy of Beingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTomash keeps wandering of原创 2014-11-23 22:01:34 · 463 阅读 · 0 评论 -
hdu 2048 神、上帝以及老天爷
#include #include#include#include#includeusing namespace std;int main(){ int n; int x; cin>>n; int64_t a[21]; a[1]=0; a[2]=1; int64_t sum=1; int i; while(n原创 2014-08-05 14:24:28 · 472 阅读 · 0 评论 -
hdu 2045 不容易系列之(3)—— LELE的RPG难题
不容易系列之(3)—— LELE的RPG难题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29590 Accepted Submission(s): 11874Problem Description人原创 2014-08-05 14:04:23 · 506 阅读 · 0 评论 -
hdu 1210 Eddy's 洗牌问题
Eddy's 洗牌问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3242 Accepted Submission(s): 2169Problem DescriptionEddy是个ACMer,他不原创 2014-08-03 15:34:31 · 686 阅读 · 0 评论