UPC 2219: A^X mod P
摘要：
题形：另类快速幂题意：f(x) = K, x = 1f(x) = (a*f(x-1) + b)%m , x > 1Now, Your task is to calculate( A^(f(1)) + A^(f(2)) + A^(f(3)) + ...... + A^(f(n)) ) modular P. 1 #include #include long long n, A, K, a, b, m, P;long long p1[100005], p2[100005];int main() { int t; scanf("%d", &t); int cas = 阅读全文
posted @ 2014-03-09 20:41 ShineCheng 阅读(237) 评论(0) 推荐(0) 编辑