http://poj.org/problem?id=2249
Binomial Showdown
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 15978 | Accepted: 4900 |
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.
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.
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.
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
Source
题意:In how many ways can you choose k elements out of n elements, not taking order into account? 有多少种方式可以选择k的元素n个元素,不考虑组合的顺序。。就是一个排列的问题。直接套的公式,看题目还有一个Warning: Don't underestimate the problem. 吓了一跳。。
排列组合模版用这个吧,现在来看,似乎代码中的排列组合模版容易溢出
__int64 C(__int64 m, __int64 n){
if(m > n - m) m = n - m;
__int64 ans = 1, cou = m;
while(cou --){
ans *= n --;
while(ans % m == 0 && m > 1)
ans /= m --;
}
return ans;
}
}
#include
#include
#include
#include
using namespace std;
__int64 C(__int64 m,__int64 n)
{
if(m>n-m)
{
m=n-m;
}
__int64 ans=1,cou=m;
while(cou--)
{
ans*=n--;
while(ans%m==0&&m>1)
{
ans/=m--;
}
}
return ans;
}
int main()
{
__int64 n,m;
while(scanf("%I64d%I64d",&n,&m)!=EOF)
{
if(n==0&&m==0)
{
break;
}
printf("%I64d\n",C(m,n));
}
return 0;
}
#include
#include
#include
using namespace std;
__int64 C(__int64 m,__int64 n)
{
}
int main()
{
}
解法2:按照公式Cnk = n!/(k!*(n-k)!)
自己模拟下这个公式你就知道怎么进行运算的。。
Cnk = n!/(k!*(n-k)!)
//必须用double。。__int64除法的时候会有误差。。。
还有一些技巧。。C(n,m)=C(n,n-m)这里会优化很多。。
#include
#include
#include
using namespace std;
double C(double n,double m)
{
}
int main()
{
}