摘要：http://poj.org/problem?id=1331MultiplyTime Limit:1000MSMemory Limit:10000KDescription6*9 = 42" is not true for base 10, but is true for base 13. That is, 6(13) * 9(13) = 42(13) because 42(13) = 4 * 131 + 2 * 130 = 54(10).You are to write a program which inputs three integers p, q, and r and det 阅读全文

摘要：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 阅读全文