根据输入的n保存一个特定的方阵,要求a[i][j] = i * n + j + 1(a[i][j]表示第i行第j列),然后输出这个矩阵和它的转置矩阵。
#include <stdio.h>
const int MAX=10;
int main()
{
int Matrix[MAX][MAX];
int ChangedMatrix[MAX][MAX];
int n;
scanf_s("%d", &n);
printf("The original matrix is:\n");
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
Matrix[i][j] = i*n + j + 1;
printf("%3d", Matrix[i][j]);
}
printf("\n");
}
printf("The changed matrix is:\n");
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
ChangedMatrix[i][j] = Matrix[j][i];
printf("%3d", ChangedMatrix[i][j]);
}
printf("\n");
}
return 0;
}