HNUST 1411 矩阵转置

#include <iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<string>#include<cstdlib>#include<stack>using namespace std;typedef long long LL;int main(){    int n,a[205][205];    while(scanf("%d",&n)==1)    {        for(int i=1;i<=n;i++)            for(int j=1;j<=n;j++)             scanf("%d",&a[i][j]);        for(int i=1;i<=n;i++){            for(int j=1;j<=n;j++)            {               if(j!=1)               printf(" %d",a[j][i]);               else               printf("%d",a[j][i]);            }             printf("\n");         }      }    return 0;}