Leetcode 372. Super Pow (Medium) (cpp)

最新推荐文章于 2019-07-23 19:53:00 发布

Niko_Ke

最新推荐文章于 2019-07-23 19:53:00 发布

阅读量742

点赞数

分类专栏： Leetcode C++ C++ Leetcode Math 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52249381

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Math

40 篇文章 0 订阅

订阅专栏

Leetcode 372. Super Pow (Medium) (cpp)

Tag: Math

Difficulty: Medium

/*

372. Super Pow (Medium)

Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.

Example1:

a = 2
b = [3]

Result: 8
Example2:

a = 2
b = [1,0]

Result: 1024

*/
class Solution {
public:
	int superPow(int a, vector<int>& b) {
		if (a % 1337 == 0) return 0;
		int p = 0;
		for (int i : b) 
			p = (p * 10 + i) % 1140;
		if (p == 0) p += 1140;
		return power(a, p, 1337);
	}
	int power(int x, int n, int mod) {
		int ret = 1;
		for (x %= mod; n; x = x * x % mod, n >>= 1) 
			if (n & 1) ret = ret * x % mod;
		return ret;
	}
};