『算法-ACM 竞赛-POJ』-3278CatchThatCow 简单搜索POJ - 3278 Catch That Cow 简单搜索Farmer 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 ≤ 1

『算法-ACM 竞赛-POJ』-3074Sudoku（搜索）剪枝+位运算优化POJ - 3074 Sudoku （搜索）剪枝+位运算优化In the game of Sudoku, you are given a large 9 × 9 grid divided into smaller 3 × 3 subgrids. For example, | . | 2 | 7 | 3 | 8 | . |

『算法-ACM 竞赛-POJ』-2387TiltheCowsComeHome（最短路入门）POJ - 2387 Til the Cows Come Home （最短路入门）Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John w

『算法-ACM 竞赛-POJ』-2251DungeonMaster（搜索)POJ - 2251 Dungeon Master（搜索)You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be f

『算法-ACM 竞赛-POJ』-1321 棋盘问题POJ - 1321 棋盘问题在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放 k 个棋子的所有可行的摆放方案 C。 Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个 n*n 的

『算法-ACM 竞赛-POJ』 3616 Milking TimeMilking Time Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15650 Accepted: 6644Description Bessie is such a hard-working cow. In fact, she is so focused on

『算法-ACM 竞赛-POJ』 3581 Prime Gap（二分） Prime Gap Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 11009 Accepted: 6298 Description The sequence of n − 1 consecutive composite numbers

『算法-ACM 竞赛-POJ』 3273 Monthly Expense Monthly Expense Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 38688 Accepted: 14256 Description Farmer John is an astounding accounting wizard and ha

『算法-ACM 竞赛-POJ』 3267 为什么优先队列超时，DP 就能过，难过The Cow LexiconTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11846 Accepted: 5693Description Few know that the cows have their own dictionary with W

『算法-ACM 竞赛-POJ』 3241Object Clustering 曼哈顿距离最小生成树Object Clustering Description We have N (N ≤ 10000) objects, and wish to classify them into several groups by judgement of their resemblance. To simply