juz.cpp

来自「用宏定义的方法实现对距阵的转置」· C++ 代码 · 共 63 行

#include<iostream>

using namespace std;
#define n 2
#define m 3
int count=0;

void main()
{
int i,j;
count++;
int a[n][m],b[m][n];
count++;
cout<<"请输入"<<n<<"行"<<m<<"列的距阵"<<"\n";
for(i=0;i<n;i++)
{cout<<"请输入第"<<i<<"行";
for(j=0;j<m;j++)
{cout<<"第"<<j<<"列\n";
	cin>>a[i][j];
count++;
}
}
count++;
cout<<"原距阵:\n";
count++;
for(i=0;i<n;i++)
{
	for(j=0;j<m;j++)
	{
		cout<<a[i][j]<<"    ";
count++;
	}
	count++;
	cout<<"\n";
count++;
}
count++;
cout<<"转置距阵:\n";
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{b[j][i]=a[i][j];
count++;
}
count++;
}
count++;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
cout<<b[i][j]<<"  ";
count++;
}
count++;
cout<<"\n";
count++;
}
count++;
cout<<count<<"步\n";

}