/*
* POJ_1306.cpp
*
* Created on: 2013年10月8日
* Author: Administrator
*/
#include <iostream>
#include <cstdio>
using namespace std;
unsigned int c[110][110];
void work(){
int i,j;
for(i = 0 ; i < 102 ; ++i){
c[i][0] = 1;
}
for(i = 1 ; i < 102 ; i++){
for(j = 1 ; j < 102 ; ++j){
c[i][j] = c[i-1][j-1] + c[i-1][j];
}
}
}
int main(){
work();
int n,m;
while(scanf("%d%d",&n,&m)!=EOF,n){
printf("%d things taken %d at a time is %d exactly.\n",n,m,c[n][m]);
}
}
(组合数学3.1.2.2)POJ 1306 Combinations(c[i][j] = c[i-1][j] + c[i-1][j-1]的实现)
最新推荐文章于 2021-11-02 20:00:07 发布