2014年12月_键盘上的舞者

12月 11月 09月 08月 07月 05月 04月 03月 02月

原创 FZU2127:养鸡场

Problem DescriptionJason买来了n米长的竹篱笆，打算将n米长的竹篱笆全部用来围成一个三角形的养鸡场。为方便起见，养鸡场三条边的长度都为正整数。同时，他想让自己的养鸡场看起来更美观一些，要求三条边的长度分别在一个区间范围内。现在，他想知道有多少种不同的方案使得围成的养鸡场满足要求？ Input输入包含多组数据。输入数据第一行是一个正整数n，表示竹篱笆

2014-12-17 10:27:59 1797

原创 FZU2125:简单的等式

Problem Description现在有一个等式如下：x^2+s(x,m)x-n=0。其中s(x,m)表示把x写成m进制时，每个位数相加的和。现在，在给定n，m的情况下，求出满足等式的最小的正整数x。如果不存在，请输出-1。 Input有T组测试数据。以下有T(T Output输出T行，有1个数字，满足等式的最小的正整数x。如果不存在，请输出-1。 Samp

2014-12-17 10:27:18 1573

原创 FZU2126:消去游戏(DP)

Problem DescriptionS最近在玩一种游戏。这种游戏的规则是一个一个地往一个栈里放有颜色的球，当栈顶连续k个球颜色相同时，这k个球立刻同时消失。现在S已经往栈里放了n个球，他想知道再放m个球，然后使得栈里的球都被消去的放法有多少种。两种放法不同是指存在放的第i个球这两种放法放的球的颜色不同。由于方法数可能很多，将答案mod 1000000007。 Input输入包

2014-12-17 10:22:02 1311

原创 ZOJ3662:Math Magic(完全背包)

Yesterday, my teacher taught us about math: +, -, *, /, GCD, LCM... As you know, LCM (Least common multiple) of two positive numbers can be solved easily because of a * b = GCD (a, b) * LCM (a, b).

2014-12-15 22:57:55 1929

原创 ZOJ3524:Crazy Shopping(拓扑排序+完全背包)

Because of the 90th anniversary of the Coherent & Cute Patchouli (C.C.P), Kawashiro Nitori decides to buy a lot of rare things to celebrate.Kawashiro Nitori is a very shy kappa (a type of wate

2014-12-15 22:45:48 2112 1

原创 ZOJ3623:Battle Ships(完全背包)

Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which has L longevity. The player has a military factory, which can produce N kinds of batt

2014-12-15 22:39:06 1851

原创 HDU4101:Ali and Baba(BFS)

Problem DescriptionThere is a rectangle area (with N rows and M columns) in front of Ali and Baba, each grid might be one of the following:1. Empty area, represented by an integer 0.2. A Stone

2014-12-13 14:10:34 1099

原创 HDU3533:Escape(BFS)

Problem DescriptionThe students of the HEU are maneuvering for their military training.The red army and the blue army are at war today. The blue army finds that Little A is the spy of the red ar

2014-12-13 13:59:14 4264

原创 hdu2614:Beat(dfs)

Problem DescriptionZty is a man that always full of enthusiasm. He wants to solve every kind of difficulty ACM problem in the world. And he has a habit that he does not like to solvea problem th

2014-12-13 13:36:51 2691

原创 HDU2102:A计划(BFS)

Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主被关在一个两层的迷宫里，迷宫的入口是S（0，0，0），公主

2014-12-13 13:32:20 3438

原创 HDU3309:Roll The Cube(BFS)

Problem DescriptionThis is a simple game.The goal of the game is to roll two balls to two holes each.'B' -- ball'H' -- hole'.' -- land'*' -- wallRemember when a ball rolls into a hole, t

2014-12-11 20:54:24 1527

原创 HDU4281:Judges' response(mTSP问题)

Problem Description　　The contest is running and the judges is busy watching the progress of the contest. Suddenly, N - 1 (N <= 16) contestants hand up their hand at the same time. The judges shoul

2014-12-11 19:45:16 2376 2

原创九度1497：面积最大的全1子矩阵

题目描述：在一个M * N的矩阵中，所有的元素只有0和1，从这个矩阵中找出一个面积最大的全1子矩阵，所谓最大是指元素1的个数最多。输入：输入可能包含多个测试样例。对于每个测试案例，输入的第一行是两个整数m、n(1矩阵共有m行，每行有n个整数，分别是0或1，相邻两数之间严格用一个空格隔开。输出：对应每个测试案例，输出矩阵中面积最

2014-12-10 18:48:37 2902

原创 HDU2126:Buy the souvenirs

Problem DescriptionWhen the winter holiday comes, a lot of people will have a trip. Generally, there are a lot of souvenirs to sell, and sometimes the travelers will buy some ones with pleasure. N

2014-12-10 16:21:15 1229

原创 FZU2109：Mountain Number(数位DP)

Problem DescriptionOne integer number x is called "Mountain Number" if:(1) x>0 and x is an integer;(2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a[0] is positive). Any a[2i+1] is larger o

2014-12-10 16:04:16 1653

原创 FZU2108:Mod problem(数学)

Problem DescriptionGiven one non-negative integer A and one positive integer B, it’s very easy for us to calculate A Mod B. Here A Mod B means the remainder of the answer after A is divided by B.

2014-12-10 15:58:53 1716

原创 FZU2107:Hua Rong Dao(DFS)

Problem DescriptionCao Cao was hunted down by thousands of enemy soldiers when he escaped from Hua Rong Dao. Assuming Hua Rong Dao is a narrow aisle (one N*4 rectangle), while Cao Cao can be regar

2014-12-10 15:54:39 1729