都是简单的排列组合公式的实现,注意有时不合适的计算可能会产生溢出
poj2249:
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
typedef long long int64;
int64 solution(int64 n, int64 k)
{
if (k > n / 2)
k = n - k;
int64 a = 1, b = 1;
for (int i = 1; i <= k; i++)
{
a *= (n + 1 - i);
b *= i;
if (0 == a % b)
{
a /= b;
b = 1;
}
}
return a / b;
}
int main()
{
int n, k;
cin >> n >> k;
while (n || k)
{
cout << solution(n, k) << endl;
cin >> n >> k;
}
return 0;
}
poj 1306: 使用了二项式系数公式(c[i][j] = c[i - 1][j - 1] + c[i - 1][j])
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
typedef unsigned long long LL;
const int maxn = 101;
LL c[maxn][maxn];
void init()
{
for (int i = 0; i < maxn; i++)
c[i][0] = 1;
for (int i = 1; i < maxn; i++)
{
for (int j = 1; j <= i; j++)
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
}
int main()
{
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
init();
int n, m;
while ((EOF != scanf("%d%d", &n, &m)) && (n || m))
{
printf("%d things taken %d at a time is %d exactly.\n", n, m, c[n][m]);
}
return 0;
}