P1009 [NOIP1998 普及组] 阶乘之和 个人刷题006

P1009 [NOIP1998 普及组] 阶乘之和

P1009 [NOIP1998 普及组] 阶乘之和

题解

乘法以及加法的混合版，但这里我改进使用int来存储（建议实现还是用char，int会占用更大的空间）每次乘/加完再统一处理进位，缺点是进位的地方难以确认长度，采用了全部扫描的方法，实际只需要扫描原长度的2倍应该就足够了。
一个NUM存储i的阶乘，一个用来求和。注意进位处理就没什么问题了。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1000;

struct Num {
	int num[1001];
	int start;
	int len;
};

typedef struct Num NUM;

void checkUP(NUM& a);//进位检测;

void InitNum(NUM& n)
{
	n.start = N;
	n.len = 1;
	for (int i = 0; i <= 1000; i++)
	{
		n.num[i] = 0;
	}
}

void multipie(int n, NUM& a)//n为要乘的数
{
	for (int i = N; i > N - a.len; i--)
	{
		a.num[i] *= n;
	}
	checkUP(a);
}

void checkUP(NUM& a)//进位检测
{
	int ptr = N;
	for (int i = N; i > 0; i--)
	{
		a.num[i - 1] += a.num[i] / 10;
		a.num[i] = a.num[i] % 10;
		if (a.num[i] != 0)
			ptr = i;
	}
	a.len = N - ptr + 1;
}

NUM plusNum(NUM n1, NUM n2)
{
	NUM ans;
	InitNum(ans);
	int len = n1.len > n2.len ? n1.len : n2.len;
	int ptr = N;
	for (int i = 0; i < len; i++)
	{
		ans.num[ptr] = n1.num[ptr] + n2.num[ptr];
		ptr--;
	}
	checkUP(ans);
	return ans;
}

void printNum(NUM& a)
{
	for (int i = a.start - a.len + 1; i <= a.start; i++)
	{
		printf("%d", a.num[i]);
	}
	printf("\n");
}

int main()
{
    int n = 0;
    scanf("%d", &n);

	NUM a;
	NUM tmp;
	InitNum(a);
	InitNum(tmp);

	tmp.num[N] = 1;
	tmp.start = N;
	tmp.len = 1;
	for (int i = 1; i <= n; i++)
	{
		multipie(i, tmp);
		a = plusNum(a, tmp);
		//cout << "now, i = " << i << endl;
		//cout << "n!: ";
		//printNum(tmp);
		//cout << "sum: ";
		//printNum(a);
		//cout << "-----------------------------------" << endl;

	}

	printNum(a);
	
}