#include<stdio.h>
longlong sum;
int main()
{
int k,n,m;
while(~scanf("%d%d",&n,&m)&&(n!=0||m!=0))
{
sum =1;
m = m<(n-m)?m:n-m;
for(k =1;k <= m;k++)
sum =(sum*(n-m+k))/k;
printf("%lld\n",sum);
}
return0;}
相关文章
- 03-17poj3107(树的重心,树形dp)
- 03-17poj1056(字符串判断是否存在一个字符串是另一个字符串的前缀)
- 03-17[并查集] POJ 1182 食物链
- 03-17POJ 2115 C Looooops(Exgcd)
- 03-17POJ2976 Dropping tests 01分数规划
- 03-17【POJ2411】Mondriaan's Dream(轮廓线DP)
- 03-17POJ 2828 Buy Tickets | 线段树的喵用
- 03-17POJ 2828 Buy Tickets(线段树·插队)
- 03-17POJ1821 Fence --- 单调队列 + DP
- 03-17迷宫问题 POJ - 3984