摘要：1148: Prime CutsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K1346447StandardA prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers from the list of prime numbe 阅读全文

摘要：1196: GoldbachResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K2275745StandardIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:Every even number greater than 4 can be written as the sum of two odd prime num 阅读全文

摘要：2573: Product of two primesResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s65536K929287Standard输出所有在10000 – 20000之间，恰好可以分解为两个素数乘积的整数。将这些数从小到大输出。Input无Output每一行输出一个符合要求的数，按照从小到大排列。下面是输出的头和尾，中间部分需自行计算10001.........19999Problem Source:skywindThis problem is used for contest:131Submit/Problem List/S 阅读全文

摘要：1873: Power StringsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE10s8192K650258StandardGiven two stringsaandbwe definea*bto be their concatenation. For example, ifa = "abc"andb = "def"thena*b = "abcdef". If we think of concatenation as multiplication, exponentiation 阅读全文

摘要：1611: Perfect CubesResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K780320StandardFor hundreds of years Fermat's Last Theorem, which stated simply that forn> 2 there exist no integersa,b,c> 1 such that, has remained elusively unproven. (A recent proof is believed to be correct, tho 阅读全文