PTA - L1-008 求整数段和

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

int Num1 = 0;
int Num2 = 0;
int res = 0;
int Flag = 0;

int main()
{
	cin >> Num1 >> Num2;

	for (; Num1 <= Num2; ++Num1)
	{
		res += Num1;
		Flag += 1;
		cout << setw(5) << Num1;
		if (0 != (Num2 - Num1 + 1) % 5 && Num1 == Num2)
		{
			cout << endl;
		}
		else if (Flag && 0 == Flag % 5)
		{
			cout << endl;
		}
	}

	cout << "Sum = " << res;

	return 0;
}