https://ac.nowcoder.com/acm/contest/330/E
分析题意,求2^n,但n很大。
根据上图公式,因为mod=1e9+7为质数,欧拉函数即为mod-1.
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int xx = 1e9 + 6;
char a[100005], b[100005];
int c[100005];
ll qpow(ll x) {
ll a = 2, res = 1;
while(x) {
if(x & 1) res = res * a % mod;
x >>= 1;
a = a * a % mod;
}
return res;
}
int main()
{
scanf("%s%s", a, b);
int len = strlen(a);
for(int i = 0; i < len; i++)
c[i] = a[i] - '0';
ll ans = 0;
for(int i = 0; i < len; i++) {
ans = ans * 10 + c[i];
ans %= xx;
}
printf("%lld\n", qpow(ans));
}