From dcd9edaea8a3acc02369579fd50aabcb5a7e67cd Mon Sep 17 00:00:00 2001
From: "nayeon, Kim" <55524773+Blue-Kite@users.noreply.github.com>
Date: Sun, 3 Apr 2022 18:02:02 +0900
Subject: [PATCH] Add files via upload

---
 .../\354\240\220\355\224\204.py"              | 26 +++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 "\352\271\200\353\202\230\354\227\260/\354\240\220\355\224\204.py"

diff --git "a/\352\271\200\353\202\230\354\227\260/\354\240\220\355\224\204.py" "b/\352\271\200\353\202\230\354\227\260/\354\240\220\355\224\204.py"
new file mode 100644
index 0000000..9fcf925
--- /dev/null
+++ "b/\352\271\200\353\202\230\354\227\260/\354\240\220\355\224\204.py"
@@ -0,0 +1,26 @@
+#1890
+#백준 1890번 점프
+#https://www.acmicpc.net/problem/1890
+
+def solution(board, n):
+    dp = [[0] * n for _ in range(n)] # (i, j) 좌표까지 올 수 있는 방법 수 
+    dp[0][0] = 1 #시작점부터 1 초기화
+
+    for i in range(n):
+        for j in range(n):
+            if i == n-1 and j == n-1: #종료조건
+                break
+
+            go = board[i][j]
+            if i+go < n:
+                dp[i+go][j] += dp[i][j] 
+            if j+go < n: 
+                dp[i][j+go] += dp[i][j]
+    
+    print(dp[n-1][n-1])
+n = int(input())
+board = []
+for i in range(n):
+    board.append(list(map(int, input().split())))
+
+solution(board, n)
\ No newline at end of file