BEAKJOON JAVA ALGORITHM #1890(점프)

https://www.acmicpc.net/problem/1890

import java.util.Scanner; public class a1890 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int[][] arr = new int[a+1][a+1]; for(int i=1; i<=a; i++) { for(int j=1; j<=a; j++) { arr[i][j] = sc.nextInt(); } } long[][] d = new long[a+1][a+1]; d[1][1] = 1; for(int i=1; i<=a; i++) { for(int j=1; j<=a; j++) { if(arr[i][j] == 0) continue; if(i + arr[i][j] <= a) { d[i + arr[i][j]][j] += d[i][j]; } if(j + arr[i][j] <= a) { d[i][j + arr[i][j]] += d[i][j]; } } } System.out.print(d[a][a]); } }