上一页 1 ··· 4 5 6 7 8 9 10 11 下一页
2013年7月19日
POJ 1664 放苹果（递归或DP）
摘要： 一、Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。Output... 阅读全文
posted @ 2013-07-19 14:56 InkGenius 阅读(188) 评论(0) 推荐(0) 编辑
POJ 1046 Color Me Less(浅水)
摘要： 一、DescriptionA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform jus... 阅读全文
posted @ 2013-07-19 10:58 InkGenius 阅读(146) 评论(0) 推荐(0) 编辑
POJ 1046 Color Me Less(浅水)
摘要： 一、DescriptionA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform jus... 阅读全文
posted @ 2013-07-19 10:58 InkGenius 阅读(137) 评论(0) 推荐(0) 编辑
POJ 2017 No Brainer(超级水题)
摘要： 一、DescriptionZombies love to eat brains. Yum.InputThe first line contains a single integer n indicating the number of data sets.The following n lines ... 阅读全文
posted @ 2013-07-19 09:40 InkGenius 阅读(211) 评论(0) 推荐(0) 编辑
POJ 2017 No Brainer(超级水题)
摘要： 一、DescriptionZombies love to eat brains. Yum.InputThe first line contains a single integer n indicating the number of data sets.The following n lines ... 阅读全文
posted @ 2013-07-19 09:40 InkGenius 阅读(128) 评论(0) 推荐(0) 编辑
2013年7月18日
Poj1207 The 3n + 1 problem(水题(数据)+陷阱)
摘要： 一、DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this ... 阅读全文
posted @ 2013-07-18 22:31 InkGenius 阅读(173) 评论(0) 推荐(0) 编辑
Poj1207 The 3n + 1 problem(水题(数据)+陷阱)
摘要： 一、DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this ... 阅读全文
posted @ 2013-07-18 22:31 InkGenius 阅读(166) 评论(0) 推荐(0) 编辑
Poj1159 Palindrome(动态规划DP求最大公共子序列LCS)
摘要： 一、DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to wri... 阅读全文
posted @ 2013-07-18 21:20 InkGenius 阅读(133) 评论(0) 推荐(0) 编辑
Poj1159 Palindrome(动态规划DP求最大公共子序列LCS)
摘要： 一、DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to wri... 阅读全文
posted @ 2013-07-18 21:20 InkGenius 阅读(137) 评论(0) 推荐(0) 编辑
Poj1050_To the Max(二维数组最大字段和)
摘要： 一、DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater locat... 阅读全文
posted @ 2013-07-18 12:23 InkGenius 阅读(124) 评论(0) 推荐(0) 编辑
Poj1050_To the Max(二维数组最大字段和)
摘要： 一、DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater locat... 阅读全文
posted @ 2013-07-18 12:23 InkGenius 阅读(155) 评论(0) 推荐(0) 编辑
2013年7月17日
Poj 2602 Superlong sums(大数相加)
摘要： 一、DescriptionThe creators of a new programming language D++ have found out that whatever limit for SuperLongInt type they make, sometimes programmers ... 阅读全文
posted @ 2013-07-17 11:44 InkGenius 阅读(167) 评论(0) 推荐(0) 编辑
Poj 2602 Superlong sums(大数相加)
摘要： 一、DescriptionThe creators of a new programming language D++ have found out that whatever limit for SuperLongInt type they make, sometimes programmers ... 阅读全文
posted @ 2013-07-17 11:44 InkGenius 阅读(144) 评论(0) 推荐(0) 编辑
2013年7月16日
Poj2656(水题)
摘要： 一、DescriptionJinjin is a junior school student. Besides the classes in school, Jinjin's mother also arranges some supplementary classes for her. Howev... 阅读全文
posted @ 2013-07-16 16:02 InkGenius 阅读(99) 评论(0) 推荐(0) 编辑
Poj2656(水题)
摘要： 一、DescriptionJinjin is a junior school student. Besides the classes in school, Jinjin's mother also arranges some supplementary classes for her. Howev... 阅读全文
posted @ 2013-07-16 16:02 InkGenius 阅读(139) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 下一页