-
Notifications
You must be signed in to change notification settings - Fork 1
/
bionomialCOEFFICIENT.cpp
67 lines (57 loc) · 1.39 KB
/
bionomialCOEFFICIENT.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/*************************************
* UVA - 369 >> bionomial co-efficient
* @author Amirul Islam (shiningflash)
************************************/
#include <cstdio>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <stack>
#include <list>
#include <iostream>
#include <assert.h>
/**Define memory set function**/
#define mem(x,y) memset(x,y,sizeof(x))
#define CLEAR(x) memset(x,0,sizeof(x))
/**Define function and object**/
#define pb push_back
#define Sort(v) sort(v.begin(),v.end())
#define _sort(s, n) sort(s, s+n)
#define sqr(x) ((x)*(x))
/**Define constant value**/
#define le 5001
#define ERR 1e-9
#define pi (2*acos(0))
#define PI 3.141592653589793
/**Define input**/
#define scanint(a) scanf("%d",&a)
#define scanLLD(a) scanf("%lld",&a)
typedef unsigned long long ll;
using namespace std;
/**********************End*******************/
ll bioCOEFF(int n, int k) {
ll res = 1;
if (k > n-k) k = n-k;
for (int i = 0; i < k; i++) {
res *= (n-i);
res /= (i+1);
}
return res;
}
int main() {
int n, k;
while (scanf("%d %d", &n, &k)) {
if (n == 0 && k == 0) break;
printf("%d things taken %d at a time is %llu exactly.\n", n, k, bioCOEFF(n, k));
}
return 0;
}