算法题：UVA 10313（完全背包变形）

2017年02月05日 53 阅读

算法题：UVA 10313（完全背包变形）2014-04-12In ancient days there was a country whose people had very interesting habits. Some of them were lazy, some were very rich, some were very poor and some were miser. Obviously, some of the rich were mi...

算法题：UVA 437 The Tower of Babylon （dp + DAG最长序列）

2017年02月05日 59 阅读

算法题：UVA 437 The Tower of Babylon （dp + DAG最长序列）2014-04-12 csdn博客 accelerator_The Tower of BabylonPerhaps you have heard of the legend of the Tower of Babylon. Nowadays many details of this tale have been forgotten. So now, in line...

巧妙运用二进制验证权限

2017年02月05日 56 阅读

巧妙运用二进制验证权限2014-04-12 博客园 初行在权限分配中有多个权限级别，不同用户分别有多个不同的权限。论坛的权限：查看、发帖、投票、搜索用户的权限：用户A：查看、发帖用户B：查看用户C：查看、发帖、投票、搜索分析：有四种不同的权限级别，总共2^4种权限分配方式。像这样权限等级划分和不同级别用户的权限分配采用二进制方式权限分配验证方式是最好的选择。 即每一个操作权限都用一个二进制数表示（1、10、100、1000）。总共的权限种类有2^n种，n即...

算法题：UVA 10604 （记忆化搜索 + hash）

2017年02月05日 57 阅读

算法题：UVA 10604 （记忆化搜索 + hash）2014-04-12 csdn博客 accelerator_In a chemist’s lab, there are several types of chemicals in tubes. The chemist wants to mix all these chemicals together, two chemicals at a time. Whenever two chemic...

算法题：UVA 607 （dp记忆化搜索）

2017年02月05日 53 阅读

算法题：UVA 607 （dp记忆化搜索）2014-04-12 csdn博客 accelerator_Scheduling LecturesYou are teaching a course and must cover n （ ） topics. The length of each lecture is L （） minutes. The topics require （ ） minutes each. For each topic, you mus...

算法题：UVA 531 - Compromise（dp + LCS打印路径）

2017年02月05日 56 阅读

算法题：UVA 531 - Compromise（dp + LCS打印路径）2014-04-12 csdn博客 accelerator_CompromiseIn a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not...

算法题：UVA 620 Cellular Structure （dp）

2017年02月05日 60 阅读

算法题：UVA 620 Cellular Structure （dp）2014-04-12 csdn博客 accelerator_Cellular StructureA chain of connected cells of two types A and B composes a cellular structure of some microorganisms of species APUDOTDLS.If no mutation had happen...

算法题：UVA 825 Walking on the Safe Side（记忆化搜索）

2017年02月05日 57 阅读

算法题：UVA 825 Walking on the Safe Side（记忆化搜索）2014-04-19 csdn博客 accelerator_Walking on the Safe Side Square City is a very easy place for people to walk around. The two-way streets run North-South or East-West dividing the city into ...

算法题：UVA 10651 Pebble Solitaire（bfs + 哈希判重（记忆化搜索？））

2017年02月05日 56 阅读

算法题：UVA 10651 Pebble Solitaire（bfs + 哈希判重（记忆化搜索？））2014-04-19 csdn博客 accelerator_Pebble solitaire is an interesting game. This is a game where you are given a board with an arrangement of small cavities, initially all but one occup...

算法题：UVA 10201 Adventures in Moving - Part IV（dp）

2017年02月05日 52 阅读

算法题：UVA 10201 Adventures in Moving - Part IV（dp）2014-04-19 csdn博客 accelerator_Problem A: Adventures in Moving - Part IVTo help you move from Waterloo to the big city, you are considering renting a moving truck. Gas prices being so...

算法题：UVA 10306 - e-Coins（完全背包）

2017年02月05日 52 阅读

算法题：UVA 10306 - e-Coins（完全背包）2014-04-19Problem Ge-CoinsInput: standard inputOutput: standard outputTime Limit: 10 secondsMemory Limit: 32 MBAt the Department for Bills and Coins, an extension of today"s monetary system has newly b...

算法题：UVA 10617 - Again Palindrome（dp）

2017年02月05日 53 阅读

算法题：UVA 10617 - Again Palindrome（dp）2014-04-19 csdn accelerator_再次回文输入：标准输入输出：标准输出时间限制： 2秒是àpalindorme的读取相同的从左边，因为它从右侧的一个或多个字符的序列。例如，， TOT和女士的 回文，但是，ADAM是不是。给定一个序列S 资本拉丁字母。有多少种方法可以有符号数（可能为0）的比分 淘汰，其余的序列成为一个palidrome的。 应认为是相...

算法题：HDU 1671 Phone List

2017年02月05日 64 阅读

算法题：HDU 1671 Phone List2014-04-19Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:1. Emergency 9112. Alice ...

算法题：POJ 2418 Hardwood Species （二叉搜索树）

2017年02月05日 55 阅读

算法题：POJ 2418 Hardwood Species （二叉搜索树）2014-04-19Hardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter.America"s temperate climates produce forests with hun...

算法题：UVA 10943 - How do you add？（dp）

2017年02月05日 59 阅读

算法题：UVA 10943 - How do you add？（dp）2014-04-19Problem A: How do you add？Larry is very bad at math - he usually uses a calculator, which worked well throughout college. Unforunately, he is now struck in a deserted island with his go...

算法题：UVa 11069 A Graph Problem （斐波那契）

2017年02月05日 54 阅读

算法题：UVa 11069 A Graph Problem （斐波那契）2014-04-19A Graph ProblemTime limit: 2sGiven an undirected graph of the following form with n nodes, 1 ≤ n ≤ 76:Your task is to calculate the number of subsets of nodes of the graph with t...

算法题：UVA 10006 - Carmichael Numbers（快速幂取模）

2017年02月05日 52 阅读

算法题：UVA 10006 - Carmichael Numbers（快速幂取模）2014-04-19Carmichael NumbersAn important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important field in computer science, and th...

算法题：UVA 138 - Street Numbers （数论）

2017年02月05日 56 阅读

算法题：UVA 138 - Street Numbers （数论）2014-04-19Street NumbersA computer programmer lives in a street with houses numbered consecutively （from 1） down one side of the street. Every evening she walks her dog by leaving her house and ran...

算法题：UVA 10154 Weights and Measures（dp）

2017年02月05日 54 阅读

算法题：UVA 10154 Weights and Measures（dp）2014-04-19Problem F: Weights and MeasuresI know, up on top you are seeing great sights,But down at the bottom, we, too, should have rights.We turtles can"t stand it. Our shells will all crack！...

算法题：UVA 10564 Paths through the Hourglass（dp）

2017年02月05日 58 阅读

算法题：UVA 10564 Paths through the Hourglass（dp）2014-04-19In the hourglass to the right a path is marked. A path always starts at the first row and ends at the last row. Each cell in the path （except the first） should be directly bel...