C++ Primer Plus Chapter5--循环和关系表达式

//1

#include <iostream>    
using namespace std;


int main()
{
	int number_1 = 0;
	int number_2 = 0;
	int SmallNumber = 0;
	int BigNumber = 0;
	int sum = 0;

	cout << "Enter two number:";
	cin >> number_1;
	cin >> number_2;


	if(number_1 > number_2) 
	{
		SmallNumber = number_2;
		BigNumber = number_1;
	}
	else
	{
		SmallNumber = number_1;
		BigNumber = number_2;
	}


	for (int i = SmallNumber;i <= BigNumber;i++)
	{
		sum = sum + i;
	}


	cout << "The sum of two numbers is: " << sum << endl;


	system("pause");

	return 0;

}

Enter two number:2 9
The sum of two numbers is: 44

//2（array对象、long double）

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

const int ArSize = 100;
int main()
{
	array<long double, ArSize+1> factorials;
	factorials[1] = factorials[0] = 1;
	for (int i = 2; i <= ArSize; i++)
	{
		factorials[i] = i * factorials[i-1];
	}
	for (int i = 0; i <= ArSize; i++)
	{
		cout << i << "! = " << factorials[i] << endl;
	}

	system("pause");
	return 0;

}

0! = 1
1! = 1
2! = 2
3! = 6
4! = 24
5! = 120
6! = 720
7! = 5040
8! = 40320
9! = 362880
10! = 3.6288e+006
11! = 3.99168e+007
12! = 4.79002e+008
13! = 6.22702e+009
14! = 8.71783e+010
15! = 1.30767e+012
16! = 2.09228e+013
17! = 3.55687e+014
18! = 6.40237e+015
19! = 1.21645e+017
20! = 2.4329e+018
21! = 5.10909e+019
22! = 1.124e+021
23! = 2.5852e+022
24! = 6.20448e+023
25! = 1.55112e+025
26! = 4.03291e+026
27! = 1.08889e+028
28! = 3.04888e+029
29! = 8.84176e+030
30! = 2.65253e+032
31! = 8.22284e+033
32! = 2.63131e+035
33! = 8.68332e+036
34! = 2.95233e+038
35! = 1.03331e+040
36! = 3.71993e+041
37! = 1.37638e+043
38! = 5.23023e+044
39! = 2.03979e+046
40! = 8.15915e+047
41! = 3.34525e+049
42! = 1.40501e+051
43! = 6.04153e+052
44! = 2.65827e+054
45! = 1.19622e+056
46! = 5.50262e+057
47! = 2.58623e+059
48! = 1.24139e+061
49! = 6.08282e+062
50! = 3.04141e+064
51! = 1.55112e+066
52! = 8.06582e+067
53! = 4.27488e+069
54! = 2.30844e+071
55! = 1.26964e+073
56! = 7.10999e+074
57! = 4.05269e+076
58! = 2.35056e+078
5