吴明

彩蛋 Problem about GCD Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1128Accepted Submission(s): 289 Problem Description Given intege...

关于二次探测定理的运用可以采用随机数的方法去判定也可以采用5-7个素数的方法去判定。

彩蛋 Problem Description We say that integer x, 0 < x < n, is a primitive root modulo n if and only if the minimum positive integer y which makes xy = 1 (mod n) true is φ(n) .Here φ(n) is an arith...

彩蛋 题目： D. Notepad time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output Nick is attracted by everything unconventional. He doesn't lik...