题解 | #序列重组矩阵#

import java.util.Scanner;
public class Main {
    
    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        int n,m;
        n = sc.nextInt();
        m = sc.nextInt();
        int[][] array = new int[n][m];
        while(sc.hasNextInt()) {
            for(int i = 0; i < n ; i++){
                for(int j = 0 ; j < m ; j++) {
                    array[i][j] = sc.nextInt();
                    System.out.print( array[i][j] + " ");
                }
                System.out.println();
            }
        }
    }
}