#include<iostream>
using namespace std;
int main()
{
int i, j;
int sum1 = 0, sum2 = 0, sum3 = 0;
int a1d[3][3] =
{
{1,2,3},
{4,5,6},
{7,8,9}
};
int(*p2d)[3] = a1d;
for (i = 1; i < 3; i++)
{
for (j = 0; j < i; j++)
sum1 += *(p2d[i] + j);
}cout << "下三角的和为" << sum1 << endl;
for (int a = 0; a < 3; a++)
{
for (int b = 0; b < 3; b++)
if (b == a || b < a)
{
continue;
}
else
{
sum2 += *(p2d[a] + b);
}
}cout << "上三角的和为" << sum2 << endl;
for (int c = 0; c < 3; c++)
{
for (int d = 0; d < 3; d++)
{
if (d == c)
{
sum3 += *(p2d[c] + d);
}
else
continue;
}
}cout << "主对角线的和为" << sum3;
return 0;
}
125上机2
二维数组求和
最新推荐文章于 2025-12-04 22:55:08 发布
3691

被折叠的 条评论
为什么被折叠?



