4 solutions

  • 2
    @ 2025-11-17 19:04:17
    #include<bits/stdc++.h>
    using namespace std;
    int a[110][110];
    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
      @ 2025-11-21 18:47:52
      #include<bits/stdc++.h>
      using namespace std;
      int a[110][110];
      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;
      }
      • 0
        @ 2026-7-31 21:53:52
        #include<bits/stdc++.h>
        using namespace std;
        int a[110][110];
        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;
        }
        • -8
          @ 2024-7-20 15:40:33

          打倒伪季

          • 1

          Information

          ID
          909
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          3
          Tags
          (None)
          # Submissions
          105
          Accepted
          53
          Uploaded By