【51Nod 1622】【算法马拉松 19C】集合对

http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1622

简单题。。直接暴力快速幂

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

typedef long long ll;
const ll p = 1000000007;

int main() {
	ll A, B, C;
	scanf("%lld%lld%lld", &A, &B, &C);
	ll t = 2, ans = 1;
	while (C) {
		if (C & 1) ans = (ans * t) % p;
		t = (t * t) % p;
		C >>= 1;
	}
	printf("%lld\n", ans);
	return 0;
}