6 solutions

  • 2
    @ 2024-1-28 11:15:04
    #include <bits/stdc++.h>
    using namespace std;
    int n,m;
    int a[105][105];
    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 = 1;j <= n;j++) cout << a[j][i] << " ";
    		cout << endl;
    	}
        return 0;
    }
    

    秒了

    • 0
      @ 2023-12-25 19:42:53
      #include <bits/stdc++.h>
      using namespace std;
      int main(){
      	int n,m;cin>>n>>m;int a[n+5][m+5];
      	for(int i=0;i<n;i++)
      		for(int j=0;j<m;j++) cin>>a[i][j];
      	for(int i=0;i<m;i++){
      		for(int j=0;j<n;j++) cout<<a[j][i]<<" ";
      		cout<<endl;
      	}
      	return 0;
      }//water
      
      • 0
        @ 2023-10-12 22:06:46

        #include<bits/stdc++.h> using namespace std; int c[1000][1000]; int main(){ long long a,b; cin>>a>>b; for(int i=0;i<a;i++) { for(int j=0;j<b;j++){ cin>>c[i][j]; } }for(int j=0;j<b;j++) { for(int i=0;i<a;i++){ cout<<c[i][j]<<" "; } cout<<endl; }

        }

        • 0
          @ 2023-10-4 18:43:04
          #include <bits/stdc++.h>
          using namespace std;
          int main(int argc, char **argv){
          	int n,m;
          	cin >> n >> m;
          	int a[n + 5][m + 5];
          	for (int i = 0;i < n;i++){
          		for (int j = 0;j < m;j++){
          			cin >> a[i][j];
          		}
          	}
          	for (int i = 0;i < m;i++){
          		for (int j = 0;j < n;j++){
          			printf("%d ",a[j][i]);
          		}
          		cout << endl;
          	}
          	return 0;
          }
          
          • 0
            @ 2023-10-3 16:14:08

            #include using namespace std; int main(){ int n,m; cin>>n>>m; int a[n][m]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>a[i][j]; } } for(int j=0;j<m;j++){ for(int i=0;i<n;i++){ cout<<a[i][j]<<" "; } cout<<endl; }

            return 0;
            

            }

            • 0
              @ 2023-9-29 10:51:42
              #include <set>
              #include <ios>
              #include <list>
              #include <cmath>
              #include <ctime>
              #include <queue>
              #include <deque>
              #include <stack>
              #include <vector>
              #include <bitset>
              #include <cctype>
              #include <cerrno>
              #include <cwchar>
              #include <cstdio>
              #include <fenv.h>
              #include <iosfwd>
              #include <string>
              #include <limits>
              #include <math.h>
              #include <cstdlib>
              #include <iomanip>
              #include <clocale>
              #include <complex>
              #include <cstring>
              #include <cstring>
              #include <cwctype>
              #include <istream>
              #include <ostream>
              #include <sstream>
              #include <fstream>
              #include <utility>
              #include <stdio.h>
              #include <iostream>
              #include <stdint.h>
              #include <string.h>
              #include <tgmath.h>
              #include <complex.h>
              #include <algorithm>
              #include <exception>
              #include <stdbool.h>
              #include <stdexcept>
              #include <streambuf>
              #include <functional>
              #include <inttypes.h>
              #include <bits/stdc++.h>
              using namespace std;
              int a[105][105];
              int main(){
              	int n,m;
              	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 = 1;j <= n;j++){
              			cout << a[j][i] << " ";
              		}
              		cout << endl;
              	}
              	
              	return 0;
              }`
              

              终于做出来了

              • 1

              Information

              ID
              612
              Time
              1000ms
              Memory
              256MiB
              Difficulty
              4
              Tags
              # Submissions
              118
              Accepted
              52
              Uploaded By