There are NN children in kindergarten. Miss Li bought them NN candies. To make the process more interesting, Miss Li comes up with the rule: All the children line up according to their student number (1...N)(1...N), and each time a child is invited, Miss Li randomly gives him some candies (at least one). The process goes on until there is no candy. Miss Li wants to know how many possible different distribution results are there.
The first line contains an integer TT, the number of test case.
The next TT lines, each contains an integer NN.
1 \le T \le 1001≤T≤100
1 \le N \le 10^{100000}1≤N≤10100000
For each test case output the number of possible results (mod 1000000007).
1 4
8
题解：费马小定理：a^n%p=a^(n%(p-1))%p;只要求n%(p-1)然后，快速幂求a^()即可：
参考代码为：
#include<stdio.h>
#define MOD 1000000007
char st[100001];
int T;
long long sum;
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%s",st);
int i=0,j;
sum=0;
while(st[i]!=‘\0‘)
{
sum=sum*10;
sum+=(st[i]-‘0‘);
i++;
sum=sum%(MOD-1);
}
sum=sum-1;
long long temp=2,ret=1;
while(sum)
{
if(sum&1) ret=ret*temp%MOD;
temp=temp*temp%MOD;
sum>>=1;
}
printf("%lld\n",ret);
}
return 0;
}
ACM-ICPC 2018 焦作赛区网络预赛 G题 Give Candies
原文：https://www.cnblogs.com/songorz/p/9651898.html