2786: Ural1142 Relation (递推+高精度)

用=号连接的元素看做一个集合，忽略顺序；

定义f[i][j] 为前i个元素分成j组的方案数；

第i个元素

1、新建一个集合 由 f[i-1][j-1]*j;

2、归入原有集合 由 f[i-1][j]*j;

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct Q {
	int l, s[100];
	Q () { l = 1; memset (s, 0, sizeof s); }
}f[51][51], s[51], a, b;
inline Q operator + (const Q & a, const Q & b)
{
	Q c;
	c.l = max (a.l, b.l);
	for (int i = 1; i <= c.l; i ++)
	{
		c.s[i] += a.s[i] + b.s[i];
		c.s[i + 1] += c.s[i] / 10;
		c.s[i] %= 10;
	}
	if (c.s[c.l + 1]) c.l ++;
	return c;
}
inline Q operator * (const Q & a, int b)
{
	Q c;
	c.l = a.l;
	for (int i = 1; i <= a.l; i ++)
	{
		c.s[i] += a.s[i] * b;
		c.s[i + 1] += c.s[i] / 10;
		c.s[i] %= 10;
	}
	while (c.s[c.l + 1]) c.l ++;
	return c;
}
inline void print (const Q & a)
{
	for (int i = a.l; i >= 1; i --)
		printf ("%d", a.s[i]);puts ("");
}
int main ()
{

	int T;
	scanf ("%d", &T);
	s[1].s[1] = f[1][1].s[1] = 1;
	for (int i = 2; i <= 50; i ++)
		for (int j = 1; j <= i; j ++)
			s[i] = s[i] + (f[i][j] = f[i - 1][j] * j + f[i - 1][j - 1] * j);
	while (T --)
	{
		int n;
		scanf ("%d", &n);
		print (s[n]);
	}
	return 0;
}