数论--快速幂

最新推荐文章于 2023-02-05 14:29:17 发布

caorui_blog

最新推荐文章于 2023-02-05 14:29:17 发布

阅读量203

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/xiaorui98/article/details/79408527

版权

数论专栏收录该内容

7 篇文章 0 订阅

订阅专栏

UVALive5346 UVA374 Big Mod【快速幂】

Calculate

R := B ^ P mod M

for large values of B, P, and M using an efficient algorithm. (That’s right, this problem has a time dependency !!!.)

Input

The input will contain several test cases, each of them as described below. Consecutive test cases are separated by a single blank line.

Three integer values (in the order B, P, M) will be read one number per line. B and P are integers in the range 0 to 2147483647 inclusive. M is an integer in the range 1 to 46340 inclusive.

Output

For each test, the result of the computation. A single integer on a line by itself.

Sample Input

18132

1765

2374859

3029382

36123

Sample Output

13195

/* UVALive5346 UVA374 Big Mod */  
  
#include <stdio.h>  
  
typedef unsigned long long ULL;  
  
// 快速模幂计算函数  a^n%m   假如求7^11
ULL powermod(ULL a, ULL n, ULL m)  
{  
   ULL res = 1;  
    while(n) {  //当n大于零的时候执行
        if(n & 1) {        // n % 2 == 1  奇数
            res *= a;      //把res的值变成7，用于接下来的计算
            res %= m;  
        }  
        a *= a;  
        a %= m;  
        n >>= 1;  //n = n / 2
    }  
  
    return res;  
}  
  
int main(void)  
{  
    ULL b, p, m;  
  
    while(~scanf("%lld%lld%lld", &b, &p, &m)) {  
        printf("%lld\n", powermod(b, p, m));  
    }  
  
    return 0;  
}  
//