摘要： Mersenne Composite NumbersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1494Accepted: 698DescriptionOne of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular ca 阅读全文

摘要： DiscountTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 57Accepted Submission(s): 47Problem DescriptionAll the shops use discount to attract customers, but some shops doesn’t give direct discount on their goods, instead, they give discount only whe 阅读全文

摘要： Pseudoprime numbersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4496Accepted: 1716DescriptionFermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not ve 阅读全文