POJ 2249 Binomial Showdown（排列组合）

最新推荐文章于 2018-09-02 08:49:54 发布

键盘上的精灵

最新推荐文章于 2018-09-02 08:49:54 发布

阅读量574

点赞数

分类专栏：数学问题文章标签： ACM 排列组合

本文链接：https://blog.csdn.net/yangkunpengD/article/details/51553389

版权

数学问题专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Description
In how many ways can you choose k elements out of n elements, not taking order into account?
Write a program to compute this number.
Input
The input will contain one or more test cases.
Each test case consists of one line containing two integers n (n>=1) and k (0<=k<=n).
Input is terminated by two zeroes for n and k.
Output
For each test case, print one line containing the required number. This number will always fit into an integer, i.e. it will be less than 2 31.
Warning: Don't underestimate the problem. The result will fit into an integer - but if all intermediate results arising during the computation will also fit into an integer depends on your algorithm. The test cases will go to the limit.
Sample Input
4 2
10 5
49 6
0 0
Sample Output
6
252

13983816

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
__int64 f[10000000];
int main()
{
    __int64 n,m;
    while(scanf("%I64d%I64d",&n,&m),n||m)
    {
        f[0]=1;
        if(m>n/2)///优化不然会超时
            m=n-m;
        for(int i=1; i<=m; i++)
        {
            f[i]=f[i-1]*(n-i+1)/i;
        }
        printf("%I64d\n",f[m]);
    }
}