洛谷P1009 [NOIP1998 普及组] 阶乘之和

#include<iostream>
#include<vector>
using namespace std;

vector<int>add_add(vector<int>& a, vector<int>& b)
{
	vector<int>c;
	int t = 0;
	for (int i = 0; i < a.size()||i<b.size(); i++)
	{
		if (i < a.size()) t += a[i];
		if (i < b.size()) t += b[i];

		c.push_back(t % 10);
		t /= 10;
	}

	return c;
}

vector<int>mul(int x)
{
	vector<int>d(1);
	d[0] = 1;
	int t = 0;
	for (int i = 1; i <= x; i++)
	{
		for (int j = 0; j < d.size(); j++)
		{
			t += d[j] * i;
			d[j] = t % 10;
			t  /= 10;
		}
		while(t > 0)
		{
			d.push_back(t % 10);
			t /= 10;
		}
	}
	return d;
}


int main()
{
	//vector<int>p = mul(6);

	//for (int i = 0; i < p.size(); i++)
	//{
	//	cout << p[i] << endl;
	//}

	int n;
	cin >> n;
	vector<int>a;

	for (int i = 1; i <= n; i++)
	{
		vector<int>b = mul(i);
		a = add_add(a, b);
	}

	for (int i = a.size() - 1; i >= 0; i--)
	{
		cout << a[i];
	}
}