排列组合中的组合的求值

#include <bits/stdc++.h>

using namespace std;

int m, n, fm, fz;

int main() {
	while (cin >> n >> m) {
		fm = fz = 1;
		if (m > n) {
			cout << 0 << endl ;
			continue;
		}
		else {
			for (int i = 0; i < m; i++) {
				fm = fm * (n - i);
				fz = fz * (m - i);
			}
			cout << fm / fz << endl ;
		}
	} 
	return 0;
}