ACM,再见！

http://codeforces.com/problemset/problem/405/EE. Graph Cuttingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outp

http://acm.hdu.edu.cn/showproblem.php?pid=1045Problem 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 r

http://acm.hdu.edu.cn/showproblem.php?pid=4324Problem DescriptionRecently, scientists find that there is love between any of two people. For example, between A and B, if A don’t love B, then

和spfa求最短路的思路很像 用一个四维的数组记录在第i个城市，第t秒，在第k维空间中，有b包盐时的最大价值。可以看出，每次行动时间都是增加的,接下来可以考虑用bfs的思想，把每个节点按时间去处理，先处理时间早的，再处理时间晚的，每次行动分为到下一个城市或者进行穿越，这两个行动都可以选择是否在当地进行交易，然后去更新新的状态的值

http://acm.hdu.edu.cn/showproblem.php?pid=4474Problem DescriptionThere are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highl

http://acm.hdu.edu.cn/showproblem.php?pid=5012

http://115.28.76.232/problem?pid=1191Problem DescriptionYou are the prince of Dragon Kingdom and your kingdom is in danger of running out of power. You must find power to save your kingdom a

http://www.spoj.com/problems/AMR11J/ The wizards and witches of Hogwarts School of Witchcraft found Prof. Binn's History of Magic lesson to be no less boring than you found your own history

http://acm.hdu.edu.cn/showproblem.php?pid=5024

http://acm.hdu.edu.cn/showproblem.php?pid=4277Problem DescriptionLike everyone, cows enjoy variety. Their current fancy is new shapes for pastures. The old rectangular shapes are out of

http://acm.hdu.edu.cn/showproblem.php?pid=4403Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for pri

http://acm.hdu.edu.cn/showproblem.php?pid=5094Problem DescriptionThis story happened on the background of Star Trek.Spock, the deputy captain of Starship Enterprise, fell into Klingo

http://acm.hdu.edu.cn/showproblem.php?pid=5040Problem DescriptionThe legendary mercenary Solid Matt gets a classic mission: infiltrate a military base.The military base can be seen as an

题目：给出n个互不相同的字符, 并给定它们的相对大小顺序,这样n个字符的所有排列也会有一个顺序. 现在任给一个排列,求出在它后面的第i个排列.这是一个典型的康拓展开应用，首先我们先阐述一下什么是康拓展开。（1）康拓展开　　所谓康拓展开是指把一个整数X展开成如下形式：　　X=a[n]*(n-1)!+a[n-1]*(n-2)!+...+a[i]*(i-1)!+...+a[2

http://acm.hdu.edu.cn/showproblem.php?pid=5335Problem DescriptionIn an n∗m maze, the right-bottom corner is the exit (position (n,m) is the exit). In every position of this maze, the

http://acm.hdu.edu.cn/showproblem.php?pid=1043Problem DescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed w

http://acm.hdu.edu.cn/showproblem.php?pid=5355Problem DescriptionThere are m soda and today is their birthday. The 1-st soda has prepared n cakes with size 1,2,…,n. Now 1-st soda w

http://acm.hdu.edu.cn/showproblem.php?pid=5336Problem DescriptionXYZ is playing an interesting game called "drops". It is played on a r∗c grid. Each grid cell is either empty, or occupied

http://acm.hdu.edu.cn/showproblem.php?pid=2181Problem Description一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。  Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m

http://acm.hdu.edu.cn/showproblem.php?pid=5325Problem DescriptionBobo has a tree,whose vertices are conveniently labeled by 1,2,...,n.Each node has a weight wi. All the weights are distrin

http://vjudge.net/contest/view.action?cid=51696#problem/C

http://poj.org/problem?id=3009DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on

http://acm.hdu.edu.cn/showproblem.php?pid=4771Problem Description　　Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday,

http://poj.org/problem?id=1315DescriptionIn chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at m

http://poj.org/problem?id=1321Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一个空格隔开

http://poj.org/problem?id=1088DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子  1 2 3 4 5

http://poj.org/problem?id=3984Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能

BFS  和  DFS

http://acm.hdu.edu.cn/showproblem.php?pid=1010Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shak

点击打开链接方块计算Time Limit 1000msMemory Limit 65536Kdescription有一间长方形的房子，地上铺了红色、黑色两种颜色的正方形瓷砖。你站在其中一块黑色的瓷砖上，只能向相邻的黑色瓷砖移动。请写一个程序，计算你总共

Uvaoj 题目Given a m by n grid of letters, ( ), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line of letters in the gr

http://acm.hdu.edu.cn/showproblem.php?pid=2553Problem Description在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。 Input共有若干行

http://soj.me/1152#include #include #include using namespace std;int a[5][6],sum[31];bool flag;bool dis[5][6];int dx[]={2,2,1,1,-2,-2,-1,-1};int dy[]={1,-1,2,-2,1,-1,2,-2};void dfs(int x,in

http://poj.org/problem?id=3278DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a numbe

http://vjudge.net/contest/view.action?cid=50643#problem/C

http://codeforces.com/problemset/problem/6/B

http://vjudge.net/contest/view.action?cid=50788#problem/C

http://vjudge.net/contest/view.action?cid=48251#problem/A

http://vjudge.net/contest/view.action?cid=48251#problem/C  Problem A: The Monocycle A monocycle is a cycle that runs on one wheel and the one we will be considering is a

http://acm.hdu.edu.cn/showproblem.php?pid=1312