정올 1303 문제 풀이 (자바)

import java.util.Scanner;

public class Num {

    // 전역변수 선언
    public static int[] num = new int[2];
    public static int[][] result;

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        int n = 0;

        for (int i =0; i < num.length; i++) {
            num[i] = input.nextInt();
        }

        result = new int[num[0]][num[1]];

        for (int i = 0; i < num[0]; i++) {
            for (int j = 0; j < num[1]; j++) {
                n++;
                result[i][j] = n;
            }
        }
        
        resultPrintf();
    } // end of main function 
    public static void resultPrintf() {
        for (int i = 0; i < num[0]; i++) {
            for (int j = 0; j < num[1]; j++) {
                System.out.printf("%2d", result[i][j]);
                if (j != num[1]) {
                    System.out.print(" ");
                }
            }
            System.out.println();
        }
    } // end of resultPrintf function 
}