neversayno_yl的博客

Pseudoprime numbers Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8673   Accepted: 3640 Description Fermat's theorem states that for any prime number p and

Key Set Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1811    Accepted Submission(s): 952 Problem Description soda has a set S 

Raising Modulo Numbers Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 6550   Accepted: 3880 Description People are different. Some secretly read magazines f