《C++程序与设计》 WORK TEN
作者声明:诸位同志,好好努力,多思考,课后习题很经典!
T 1
//求一个 3 x 3 矩阵对角线元素之和。
//如下矩阵,对角线元素之和为 15.
// 1 2 3
// 4 5 6
// 7 8 9
#include <iostream>
using namespace std;
int main ()
{
int array [3][3] = {{1,2,3},{4,5,6},{7,8,9}};
int sum = 0;
for (int i = 0; i < 3; i ++) // 一条对角线元素之和
{
sum = sum + array [i][i];
}
cout << "1:\t" << sum << "\n";
/*sum清零*/sum = 0;
for (int i = 0; i < 3; i ++) // 一条对角线元素之和
{
sum = sum + array [i][2-i];
}
cout << "2:\t" << sum << "\n";
/*sum清零*/sum = 0;
for (int i = 0; i < 3; i ++) // 两条对角线元素之和
{
for (int j = 0; j < 3; j ++)
{
if ((i==j) || (i+j == 2))
{
sum = sum + array [i][j];
}
}
}
cout << "3:\t" << sum << "\n";
system ("pause");
}
T 2
//求一个 3 x 3 矩阵的每行元素之和 。 如题一矩阵,每行元素之和为 6 , 15 ,24 。
#include <iostream>
using namespace std;
int main ()
{
int array[3][3] = { };
int k =1;
for (int i = 0; i < 3; i ++)
{
for (int j = 0; j < 3; j ++)
{
array[i][j] = k;
k ++;
}
}
int sum = 0;
for (int i = 0; i < 3; i ++)
{
sum = 0;
for (int j = 0; j < 3; j ++)
{
sum = sum + array[i][j];
}
cout << sum << "\n";
}
system ("pause");
}
T 3
//求一个 3 x 3 矩阵的下三角元素之和 。 如题一矩阵,下三角元素之和 (即:对角线及下方的元素) 为 ?
// 1 2 3
// 4 5 6
// 7 8 9
#include <iostream>
using namespace std;
int main ()
{
int array [3][3] = {0};
int sum = 0;
int k = 1;
for (int i = 0 ; i < 3 ; i ++)
{
for (int j = 0 ; j < 3 ; j ++)
{
array [i][j] = k;
k ++;
}
}
for (int i = 0 ; i < 3 ; i ++)
{
for (int j = 0 ; j < 3 ; j ++)
{
if ((i==j) || (i + j == 2) || (i + j == 3) || (i + j == 4))
{
sum = sum + array [i][j];
}
}
}
cout << sum - array [0][0] << "\n";
system ("pause");
}
T 4
//将一个数组中的值按逆序重新存放。例如,原顺序为 8,6,5,4,1。 逆序后为 14,5,6,8。
#include <iostream>
#define N 10
using namespace std;
int main ()
{
int array [N] = {0};
for (int i = 0 ; i < N ; i ++)
{
cin >> array[i];
}
int brray [N] = {0};
for (int i = 0 ; i < N ; i ++)
{
brray [i] = array [N - i - 1];
}
for (int i = 0 ; i < N ; i ++)
{
cout << brray [i] << " ";
while ((i+1) % 5 == 0)
{
cout << endl;
break;
}
}
system ("pause");
}
T 5
//用选择法对 10 个整数排序。
#include <iostream>
#define N 10
using namespace std;
int main ()
{
int array [N] = {6 ,8 ,4 ,9 ,7 ,3 ,2 ,1 ,0 ,5};
int brray [N] = {0};
int max = array [0];
int k = 0;
for (int i = 0; i < N-1; i ++) //外部一共循环 N 次
{
k = i;
for (int j = 1 ; j < N; j ++)
{
if (max < array [j])
{
k = j;
}
else
{
break;
}
}
max = array [k];
array [k] = 0;
brray [i] = max;
}
for (int i = 0; i < N; i ++)
{
cout <<brray [i] << " ";
}
cout << "\n";
system ("pause");
}
T 5.1
//用选择法对 10 个整数排序。
#include <iostream>
#define N 10
using namespace std;
int main ()
{
int array [N] = {8 , 6 , 4 , 9 , 7 , 3 , 1 , 2 , 5 , 0};
int min = 0;
int k = 0;
for (int i = 0 ; i < N - 1 ; i ++)
{
k = i;
for (int j = i + 1 ; j < N ; j ++)
{
if (array [j] < array [k])
{
k = j;
}
min = array [k];
array [k] = array [i];
array [i] = min;
}
}
for (int i = 0; i < N ; i ++)
{
cout << array [i];
}
cout << "\n";
system ("pause");
}
T 6
//找出一个二维数组中的鞍点,即该位置上的元素在该行上最大,在该列上最小。也可能没有鞍点,此时输出信息“没有鞍点”。
// #include <iostream>
// #define M 10
// #define N 10
// using namespace std;
// int main ()
// {
// int array [M][N] = {};
// for (int i = 0 ; i < M ; i ++ )
// {
// for (int j = 0 ; j < N ; j ++)
// {
// cout << " ";
// cin >> array [i][j];
// }
// }
// system ("pause");
// }
#include <iostream>
#include <string>
using std::cout;
using std::endl;
using std::cin;//cin标准输入表达式
using std::string;
void printCinStatus()
{
cout << "cin badbit = " << cin.bad() << endl;
cout << "cin failbit = " << cin.fail() << endl;
cout << "cin eofbit = " << cin.eof() << endl;
cout << "cin goodbit = " << cin.goodbit << endl; //cin.goodbit没有"()"
}
int main()
{
int inum;
printCinStatus();
while(cin >> inum)
{
cout << "inum = " << inum << endl;
}
//
printCinStatus();
cout << endl;
cin.clear();//cin对象是有缓冲区的,使用clear将会重置badbit,failbit,eofbit和goodbit为初始值
printCinStatus();
string s;
cin >> s;
cout << "inum = " << s << endl;
return 0;
}