2018年1月15日
[POJ 2417]Discrete Logging
摘要： 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 阅读全文
posted @ 2018-01-15 16:20 NaVi_Awson 阅读(210) 评论(0) 推荐(0)
[POJ 1811]Prime Test
摘要： 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 阅读全文
posted @ 2018-01-15 09:50 NaVi_Awson 阅读(328) 评论(1) 推荐(1)