摘要：http://poj.org/problem?id=3191The Moronic CowmpouterTime Limit:1000MSMemory Limit:65536KDescriptionInexperienced in the digital arts, the cows tried to build a calculating engine (yes, it's a cowmpouter) using binary numbers (base 2) but instead built one based on base negative 2! They were quit 阅读全文

摘要：放苹果Time Limit:1000MSMemory Limit:10000KTotal Submissions:15927Accepted:10049Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。Output对输入的每组数据M和N，用一行输出相应的K。Sample Input17 3Sample Output8#include< 阅读全文