PTA基础编程题目集 7-38 数列求和-加强版

#include <iostream>

using namespace std;

int result[100000];		//结果很大，用数组保存

int main()
{

	for (int i = 0; i < 100000; i++) {
		
		result[i] = 0;

	}

	int a, n;

	cin >> a >> n;

	if (n == 0) {
		cout << "0";
		return 0;
	}

	int jin_wei = 0;	//记录进位的值
	int num = 0;		//记录最高位位置
	int i;

	for (i = 0; i < n; i++) {				//每位进行计算

		int temp = result[i] + a * (n - i) + jin_wei;

		result[i] = temp % 10;
		jin_wei = temp / 10;

	}

	while (jin_wei != 0) {					//进位不为零，最高位进位
		int temp = result[i] + jin_wei;

		result[i] = temp % 10;
		jin_wei = temp / 10;
		i++;
	}

	num = i;
	for (int i = num - 1; i >= 0; i--) {
		cout << result[i];

	}


}