HDU 2049

#include <iostream>
#include <string.h>
using namespace std;
long long he(long long a)
{
	long long b = 1;
	for (int i = 1;i <= a;i++)
		b *= i;
	return b;
}
int main()
{
	long long c, n, m;
	cin >> c;
	for (int i = 0;i < c;i++)
	{
		cin >> n >> m;
		if (m == 2)
			cout << he(n)/(he(m)*he(n-m))<<endl;
		else
		{
			long long *_m = new long long[m+1];
			_m[1] = 0, _m[2] = 1;
			for (int i1 = 3;i1 <= m;i1++)
				_m[i1] = (i1 - 1)*(_m[i1 - 1] + _m[i1 - 2]);
			cout << he(n) / (he(m)*he(n - m))*_m[m] << endl;
		}
	}
}

错排类的水题，只要知道错排，一看就知道用，会错排的话基本没问题。