POJ 3199 Uncle Jack（高精度加速乘）

Dear Uncle Jack is willing to give away some of his collectable CDs to his nephews. Among the titles you can find very rare albums of Hard Rock, Classical Music, Reggae and much more; each title is considered to be unique. Last week he was listening to one
of his favorite songs, Nobody’s fool, and realized that it would be prudent to be aware of the many ways he can give away the CDs among some of his nephews.

So far he has not made up his mind about the total amount of CDs and the number of nephews. Indeed, a given nephew may receive no CDs at all.

Please help dear Uncle Jack, given the total number of CDs and the number of nephews, to calculate the number of different ways to distribute the CDs among the nephews.

Input

The input consists of several test cases. Each test case is given in a single line of the input by, space separated, integers N (1 ≤ N ≤ 10) and D (0 ≤ D ≤ 25), corresponding to the number of nephews and the number of
CDs respectively. The end of the test cases is indicated with N = D = 0.

Output

The output consists of several lines, one per test case, following the order given by the input. Each line has the number of all possible ways to distribute D CDs among N nephews.

Sample Input

1 20
3 10
0 0

Sample Output

1
59049

题解：

很简单的一道题。。每一件礼物都可以给任何一个人，就是n的d次方，由于结果很大要高精度，一开始除10模10就tle了，老刘改成了10000就ac了

代码：

#include<iostream>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<math.h>
#include<
4000
;queue>
#include<stack>
#include<string>
#include<cstring>
using namespace std;
int t[105],m,n,b[105];
void cheng(int a[],int x)//大数乘法
{
int i,j,w=0;
for(i=0;i<=8;i++)
t[i]=0;
for(i=0;i<=8;i++)
{
t[i]+=a[i]*x+w;
w=t[i]/10000;//进位处理
t[i]%=10000;
}
}
int main()
{
int i;
while(scanf("%d%d",&m,&n),m||n)
{
if(!n)
{
printf("1\n");
continue;
}
memset(b,0,sizeof(b));
b[0]=m;
n--;
while(n--)
{
cheng(b,m);
for(i=0;i<=8;i++)
b[i]=t[i];
}
for(i=8;!b[i];i--);//去掉前导0
printf("%d",b[i]);第一位直接输出
i--;
for(;i>=0;i--)
printf("%04d",b[i]);//因为是4位4位输出，不足补0
printf("\n");
}
return 0;
}