摘要： 1.链接地址：http://bailian.openjudge.cn/practice/1979http://poj.org/problem?id=19792.题目：总时间限制:1000ms内存限制:65536kB描述There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. Bu 阅读全文

摘要： 1.链接地址：http://bailian.openjudge.cn/practice/1664http://poj.org/problem?id=16642.题目：总时间限制:1000ms内存限制:65536kB描述把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。输入第一行是测试数据的数目t（0 2 #include 3 4 using namespace std; 5 6 int f(int m,int n) 7 { 8 if(n == 1 || m == 0) return 1; 9 ... 阅读全文

摘要： 1.链接地址：http://poj.org/problem?id=1316http://bailian.openjudge.cn/practice/13162.题目：总时间限制:1000ms内存限制:65536kB描述In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the digits of n. (The d stand 阅读全文

摘要： 1.链接地址：http://poj.org/problem?id=1458http://bailian.openjudge.cn/practice/1458/2.题目：Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 35411Accepted: 14080DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a s 阅读全文