摘要：
Problem Description The picture indicates a tree, every node has 2 children. The depth of the nodes whose color is blue is 3; the depth of the node wh 阅读全文
摘要：
Description 你被要求设计一个计算器完成以下三项任务： 1、给定y,z,p,计算Y^Z Mod P 的值； 2、给定y,z,p，计算满足xy≡ Z ( mod P )的最小非负整数； 3、给定y,z,p，计算满足Y^x ≡ Z ( mod P)的最小非负整数。 你被要求设计一个计算器完成以 阅读全文
摘要：
Description Little Y finds there is a very interesting formula in mathematics: XY mod Z = K Given X, Y, Z, we all know how to figure out K fast. Howev 阅读全文
摘要：
Description Given a prime P, 2 <= P < 231, an integer B, 2 <= B < P, and an integer N, 1 <= N < P, compute the discrete logarithm of N, base B, modulo 阅读全文
摘要：
Description Given a big integer number, you are required to find out whether it's a prime number. Input The first line contains the number of test cas 阅读全文