随笔分类 - POJ
摘要:X-factor ChainsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5111Accepted: 1622DescriptionGiven a positive integer X, an X-factor chain of length m is a sequence of integers,1 = X0, X1, X2, …, Xm = XsatisfyingXi 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 #define m...
阅读全文
摘要:Prime PathTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10320Accepted: 5897DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matter of securi
阅读全文
摘要:DNA LaboratoryTime Limit: 5000MSMemory Limit: 30000KTotal Submissions: 1425Accepted: 280DescriptionBackground Having started to build his own DNA lab just recently, the evil doctor Frankenstein is not quite up to date yet. He wants to extract his DNA, enhance it somewhat and clone himself. He has al
阅读全文

浙公网安备 33010602011771号