摘要：
phi（c）为欧拉函数， 欧拉定理 ： 对于互质的正整数 a 和 n ，有 aφ(n) ≡ 1 mod n 。 A^x = A^(x % Phi(C) + Phi(C)) (mod C) (x >= phi(C)) 阅读全文
posted @ 2016-05-04 17:51
jhz033
阅读(340)
评论(0)
推荐(0)
摘要：
A. Noldbach problem A. Noldbach problem Nick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer gr 阅读全文
posted @ 2016-05-04 17:40
jhz033
阅读(179)
评论(0)
推荐(0)
摘要：
C. Monitor time limit per test 0.5 second memory limit per test 64 megabytes input standard input output standard output C. Monitor time limit per tes 阅读全文
posted @ 2016-05-04 17:26
jhz033
阅读(299)
评论(0)
推荐(0)
摘要：
C. Line time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. Line time limit per test 1 sec 阅读全文
posted @ 2016-05-04 14:43
jhz033
阅读(182)
评论(0)
推荐(0)
浙公网安备 33010602011771号