Ted's 游乐园

Anniversary partyhttp://acm.hdu.edu.cn/showproblem.php?pid=1520Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The Univ

求和Case Time Limit: 1000 ms   Memory Limit: 64 MBhttp://icpc.ahu.edu.cn/OJ/Problem.aspx?id=514Judge By CaseDescription高斯在他还很小的时候就求出1+2+...+n=n*(n+1)/2;LT在他还很小的时候就求出1/(1*2)+....+1/((

FatMouse's SpeedTime Limit: 2 Seconds      Memory Limit: 65536 KB      Special Judgehttp://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=108FatMouse believes that the fatter a mous

Robots on a gridTime Limit: 1 Sec  Memory Limit: 128 MBhttp://acdreamoj.sinaapp.com/problem.php?id=1124DescriptionYou have recently made a grid traversing robot that can finnd its way from t

Squareshttp://poj.org/problem?id=2002DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotatin

Babelfishhttp://poj.org/problem?id=2503DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you

Wireless Networkhttp://poj.org/problem?id=2236DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap com

食物链http://poj.org/problem?id=1182Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述： 第一种说法是"1 X Y"，表

Another Easy Problemhttp://acm.hdu.edu.cn/showproblem.php?pid=2418Problem DescriptionNowadays, many universities no longer force students to follow a fixed curriculum; instead they allow

Gary's Calculatorhttp://acm.hdu.edu.cn/showproblem.php?pid=2424Problem DescriptionGary has finally decided to find a calculator to avoid making simple calculational mistakes in his mat

3517.   The longest athletic trackhttp://acm.tju.edu.cn/toj/showp3517.htmlAfter a long time of algorithm training, we want to hold a running contest in our beautiful campus. Because al

我要清晰的Unicode转码表http://icpc.ahu.edu.cn/OJ/Problem.aspx?id=416Description据文件历史记录，WX曾经在2008年2月研究过Unicode，并尝试了Shift-JIS、GB2312、Unicode的相互转换问题。找资料当然要上官方网站，于是从unicode.org上Down下了官方编码映射表，不过看似这

塔http://icpc.ahu.edu.cn/OJ/Problem.aspx?id=518Description给出N个木块，告诉你每个木块的高度，你要用这些木块搭出两座高度相同的塔，一个塔的高度为搭建它的木块的高度之和，并且一个塔至少要用一个木块。木块只能用一次，也可以不用。问在这两座塔高度相同的条件下，能够搭出的塔的最大高度是多少？Input第

Saving the Universehttp://icpc.ahu.edu.cn/OJ/Problem.aspx?id=575DescriptionThe urban legend goes that if you go to the Google homepage and search for "Google", the universe will impl

产生冠军http://acm.hdu.edu.cn/showproblem.php?pid=2094Problem Description有一群人，打乒乓球比赛，两两捉对撕杀，每两个人之间最多打一场比赛。球赛的规则如下：如果A打败了B，B又打败了C，而A与C之间没有进行过比赛，那么就认定，A一定能打败C。如果A打败了B，B又打败了C，而且，C又打败了A，那么

确定比赛名次http://acm.hdu.edu.cn/showproblem.php?pid=1285Problem Description有N个比赛队（1 Input输入有若干组，每组中的第一行为二个数N（1 Output给出一个符合要求的排名。输出时队伍号之间有空格，最后一名后面没有空格。

Party at Hali-Bulahttp://acm.hdu.edu.cn/showproblem.php?pid=2412Problem DescriptionDear Contestant,I'm going to have a party at my villa at Hali-Bula to celebrate my retirement from

Divisionhttp://acm.hdu.edu.cn/showproblem.php?pid=3480Problem DescriptionLittle D is really interested in the theorem of sets recently. There’s a problem that confused him a long time.

Permutations题目：http://poj.org/problem?id=2369题意：题解：置换群。求子循环节的长度，然后求其最小公倍数。代码：#include#includeusing namespace std;int ans[1005];bool visit[1005];int gcd(int x,int b){ int c; f

DNA repair题目：http://poj.org/problem?id=3691题意：就是给定N个病毒串，然后给定一个主串，然后求出修改主串多少次使得该串不包含病毒串。题解：AC自动机+DP。首先是AC自动机的空指针要修改下，不能为空，也需要指向字典树里面的结点，为了之后在字典树上DP，然后建立fail指针。dp(i,j)表示主串匹配到第i位时在自动机上的状态为j时的最少修改

Infinite monkey theorem题目：http://acm.hdu.edu.cn/showproblem.php?pid=3689题意：字符集中有一些字符，给出每个字符的出现概率（它们的和保证为1），再给出一个子串S，问任给一个长度为N的字符串A（只能包含字符集中的字符），使得S是A的子串的概率。题解：AC自动机+DP代码：#include#include

DescriptionA number is said to be made up of non-decreasing digits if all the digits to the left of any digit is lessthan or equal to that digit. For example, the four-digit number 1234 is compo

Prime PathTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 147    Accepted Submission(s): 94Problem DescriptionThe ministers of

Parity gameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4178 Accepted: 1631DescriptionNow and then you play the following game with your friend.

Exact coverhttp://acm.hust.edu.cn/problem.php?id=1017DescriptionThere is an N*M matrix with only 0s and 1s, (1 Try to find out the selected rows. InputThere are multiply test cas

Farm IrrigationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)http://acm.hdu.edu.cn/showproblem.php?pid=1198Problem DescriptionBenny has a spaci

Computer题目：http://acm.hdu.edu.cn/showproblem.php?pid=2196题意：一个有N个结点的树，给你相邻两个结点的距离，问你对于第i个结点，树中离i最远的结点的距离是多少。题解：可以通过两次树形DP求解。dp[i][3]，i表示为在哪里结点，0表示子树中的最长距离，1表示子树中的次长距离，2表示父树的最长距离。如果结点a本身就是父结点b最

B-number题目：http://acm.hdu.edu.cn/showproblem.php?pid=3652题意：问1~n中包含"13"序列且能被13整除的数有多少个。题解：详情见代码注释。代码：#include#includeusing namespace std;int dp[15][15][3];/*dp[i][j][k] j表示余数k==0 不包含

Bomb题目：http://acm.hdu.edu.cn/showproblem.php?pid=3555题意：给你一个数字N(1 ，问在1~N这些数字中，“49”这个序列出现多少次。题解：数位DP。其实就是以一位数为单位的DP，有点类似AC自动机里的字典树。           我们可以根据字典树把情况分为3种，序列中出现“49”，序列中没有“49”但是最后一位是“4”，序列中没

Street Fighter题目：http://acm.hdu.edu.cn/showproblem.php?pid=3957题意：模拟街头霸王游戏（我都没玩过T-T），有N(2题解：DLX的重复覆盖问题，但是要考虑一个角色有多个模式，而且每个角色只能选择一次。           1)同时使用重复覆盖和精确覆盖。           2)只用重复覆盖，同时使用一个数组记录使用

whosyourdaddy 题目：http://acm.hdu.edu.cn/showproblem.php?pid=3498题意：英雄可以放一个技能，使得一个点和与其相邻的点受到伤害，问最少攻击几个点能够让所有的点都受到至少一次伤害。题解：建模套DLX模板。代码：#include#include#include#define N 60#define M 3600

Information Disturbing题目：http://acm.hdu.edu.cn/showproblem.php?pid=3586题意：给定n个敌方据点，1为司令部，其他点各有一条边相连构成一棵树，每条边都有一个权值cost表示破坏这条边的费用，叶子节点为前线。现要切断前线和司令部的联系，每次切断边的费用不能超过上限limit，问切断所有前线与司令部联系所花费的总费用少于m时的

ConformityTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2559 Accepted: 785DescriptionFrosh commencing their studies at Waterloo have diverse int

The Social NetworkTime Limit: 3000/2000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1795    Accepted Submission(s): 555Problem DescriptionThe soci

Knight MovesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2898    Accepted Submission(s): 1822Problem DescriptionA friend of y

小希的迷宫Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 5Problem Description上次Gardon的迷宫城堡小希玩了很久（见Problem

find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1160    Accepted Submission(s): 466Problem Description

Is It A Tree?Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 12   Accepted Submission(s) : 2Problem DescriptionA tree is a well-kn

Football ScoreTime Limit: 1000/1000 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 254    Accepted Submission(s): 39Problem DescriptionFootball is

Order CountTime Limit: 1000/1000 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 88    Accepted Submission(s): 5Problem DescriptionIf we connect 3