看似难实则简单

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N=1e4+10;
const int INF=0x3f3f3f3f;
int n,m,a[N][N];
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>a[i][j];
		}
	}
	for(int j=1;j<=m;j++)
	{
		for(int i=n;i>=1;i--)
	    {
		    cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
}

//@#@#@#@#@#@#@#
#include<iostream>
#include<cstdio>
#include<string>
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int INF=0x3f3f3f3f;
const int N=2e5+10;
int a[20000][20000],b,c;
int main(){
	cin>>b>>c;
	for(int i=1;i<=b;i++){
		for(int j=1;j<=c;j++){
			cin>>a[i][j];
		}
	}
	for(int i=1;i<=c;i++){
		for(int j=b;j>=1;j--){
			cout<<a[j][i]<<" ";
		}
		cout<<endl;
	}
}

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N=1e4+10;
const int INF=0x3f3f3f3f;
int n,m,a[N][N];
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>a[i][j];
		}
	}
	for(int j=1;j<=m;j++)
	{
		for(int i=n;i>=1;i--)
	    {
		    cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
}

6

#include <bits/stdc++.h>
using namespace std;
int a[105][105];
int n,m;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
		}
	}
	for(int j=1;j<=m;j++){
		for(int i=n;i>=1;i--){
			cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
	return 0;
}

#include <iostream> using namespace std; const int N=1e2+10; int a[N][N],n,m; int main() { cin >> n >> m; for(int i = 1; i <= n; i++) { for(int j = 1; j <= m; j++) { cin >> a[i][j]; } } for(int i = 1; i <= m; i++) { for(int j = n; j >= 1; j--) { cout << a[j][i] <<" "; } cout<<endl; } return 0; }

#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int a[110][110], n, m;
int main()
{
    cin >> n >> m;
	for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }
    //其实不用真的转90°
    for(int i = 1; i <= m; i++)//仔细想想这三句
    {
        for(int j = n; j >= 1; j--)//为什么一个加一个减
        {
            cout << a[j][i] << " ";//为什么要反着输出
        }
        puts("");
    }
	return 0;
}

#include <queue> #include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> using namespace std; const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; int a[110][110], n, m; int main() { cin >> n >> m; for(int i = 1; i <= n; i++) { for(int j = 1; j <= m; j++) { cin >> a[i][j]; } }

for(int i = 1; i <= m; i++)
{
    for(int j = n; j >= 1; j--)
    {
        cout << a[j][i] << " ";
    }
    cout << endl;
}
return 0;

}

#include<bits/stdc++.h> using namespace std; const int N=1e2+10; const int INF=0x3f3f3f3f; int n,m,a[N][N]; int main(){ cin>>n>>m; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>a[i][j];

for(int i=1;i<=m;i++){
	for(int j=n;j>=1;j--){
		cout<<a[j][i]<<" ";
	}
	cout<<endl;
}

return 0;

}

#include <iostream>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int a[110][110], n, m;
int main()
{
    cin >> n >> m;
	for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }
    //其实不用真的转90°
    for(int i = 1; i <= m; i++)//仔细想想这三句
    {
        for(int j = n; j >= 1; j--)//为什么一个加一个减
        {
            cout << a[j][i] << " ";//为什么要反着输出
        }
        puts("");
    }
	return 0;
}