搬运
文章平均质量分 78
吴钩揽月
这个作者很懒,什么都没留下…
展开
-
MATRIX_CHAIN
//这是按照算法导论给出解法写出的算法 #include #include #include using namespace std; ifstream fin("C:\\data17.in"); char ID[100]; int length[100],width[100]; int n; int multinum[100][100]; int s[100][100]; #define M翻译 2014-11-12 21:17:35 · 613 阅读 · 0 评论 -
0_1背包问题
//此问题由于在暑假看过提示,这里算buan转载 2014-11-11 14:51:19 · 606 阅读 · 0 评论 -
硬币问题
//此版本和wode #include #include #include using namespace std; ifstream fin("C:\\data14.in"); int S; int V[1000]; int n; int total[1000]; int scheme[10000]; void Init() { int valu转载 2014-11-11 09:06:10 · 527 阅读 · 0 评论 -
Coins Change
UVA 674 问题描述 Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to make changes with these coins for a given amount of money. For example, if we have 1转载 2014-11-16 09:45:05 · 765 阅读 · 0 评论 -
Stacking Boxes
UVA 103 问题描述 Stacking Boxes Background Some concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbi转载 2014-11-16 13:47:50 · 562 阅读 · 0 评论 -
UVA138---StreetNumber
问题描述: A 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 randomly turning left转载 2014-11-22 10:34:42 · 511 阅读 · 0 评论 -
Jugs
UVA 571 Jugs 问题描述: In the movie ``Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug and were asked to fil原创 2014-11-21 20:28:24 · 863 阅读 · 0 评论