问题 B: N的阶乘

题目链接

#pragma warning(disable:4996);
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<time.h>
#include<stdlib.h>
using namespace std;
//自己定义的结构体不需要重载=，可以直接使用，一个结构体变量赋给另一个；
struct bign
{
	int len;
	int n[100005];
	bign() {
		memset(n, 0, sizeof(n));
		len = 0;
	}
	
};
bign change(char str[]) {
	bign a;
	a.len = strlen(str);
	for (int i = 0;i < a.len;i++) {
		a.n[i] = str[a.len - 1 - i]-'0';
	}
	return a;
}
int compare(bign a, bign b) {
	if (a.len > b.len) return 1;
	else if (a.len < b.len) return -1;
	else {
		for (int i = a.len - 1;i >= 0;i--) {
			if (a.n[i] > b.n[i]) return 1;
			else if (a.n[i] < b.n[i]) return -1;
		}
		return 0;
	}
}
bign add(bign a, bign b) {
	bign c;
	int carry = 0;
	for (int i = 0;i < a.len || i < b.len;i++) {
		int temp = a.n[i] + b.n[i] + carry;
		c.n[c.len++] = temp % 10;
		carry = temp / 10;
	}
	if (carry != 0) {
		c.n[c.len++] = carry;
	}
	return c;
}
void print(bign a) {
	for (int i = a.len - 1;i >= 0;i--) {
		printf("%d", a.n[i]);
	}
}
bign multi(bign a, int b) {
	bign c;
	int carry = 0;
	for (int i = 0;i < a.len;i++) {
		int temp = a.n[i] * b + carry;
		c.n[c.len++] = temp % 10;
		carry = temp / 10;
	}
	while (carry != 0) {
		c.n[c.len++] = carry%10;
		carry /= 10;
	}
	return c;
}

int main() {
	int a;
	while (scanf("%d", &a) != EOF) {
		if (a == 0) {
			printf("1\n");
			continue;
		}
		char x[2] = "1";
		bign num = change(x);
		for (int i = 1;i <= a;i++) {
			bign temp = multi(num, i);
			 num=temp;//把值赋给num，进行循环来计算阶乘；		
			//print(temp);
		}
		print(num);
		printf("\n");
	}
	return 0;
}