POJ 1492【Paths on a Grid】

​//708K		0MS


#include <iostream>
#include <algorithm>

using namespace std;

unsigned N , M;

unsigned C(unsigned n , unsigned m){
	double Cnm = 1;
	//将(N-M)!约掉
	while(m)
		Cnm *= double(n--)/double(m--);
	Cnm += 0.5;
	return (unsigned)Cnm;
}

int main(){
	while(cin>>N>>M && (N+M)){
		if(N < M)
			swap(N , M);
		N+=M;
		cout<<C(N , M)<<endl;
	}
	return 0;
}​