๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
  • What would life be If we had no courage to attemp anything?
Problem Solving/BAEKJOON

[baekjoon]python #14494 ๋‹ค์ด๋‚˜๋ฏน์ด ๋ญ์˜ˆ์š”?

by DevIseo 2022. 5. 18.

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

 

14494๋ฒˆ: ๋‹ค์ด๋‚˜๋ฏน์ด ๋ญ์˜ˆ์š”?

(1, 1)์—์„œ (n, m)์— ๋„๋‹ฌํ•˜๋Š” ๊ฒฝ์šฐ์˜ ์ˆ˜๋ฅผ ๊ตฌํ•˜์—ฌ๋ผ. ๋‹จ, ๊ฒฝ์šฐ์˜ ์ˆ˜๊ฐ€ ์—„์ฒญ ์ปค์งˆ ์ˆ˜ ์žˆ์œผ๋ฏ€๋กœ ๊ฒฝ์šฐ์˜ ์ˆ˜๋ฅผ 1,000,000,007(=109+7)๋กœ ๋‚˜๋ˆˆ ๋‚˜๋จธ์ง€๋ฅผ ์ถœ๋ ฅํ•œ๋‹ค.

www.acmicpc.net

n,m = map(int,input().split())
arr = [[0]*(m+1) for _ in range(n+1)]

arr[1][1] = 1
for y in range(1,n+1):
    for x in range(1,m+1):
        if x==1 and y==1:continue
        arr[y][x] = arr[y][x-1]+arr[y-1][x]+arr[y-1][x-1]

print(arr[n][m]%1000000007)

๐ŸŽˆ๋ฌธ์ œ์— ์ œ์‹œ๋œ ์‹์„ ์‘์šฉํ•˜์—ฌ ํ’€์ด.

๐ŸŽˆ๋Œ€๊ฐ์„  ๋ฐฉํ–ฅ์€ arr[y-1][x-1]์„ ์‚ฌ์šฉํ•˜๋ฉด ๋œ๋‹ค!

๐ŸŽˆ๋‚˜๋Š” ๋ฐฐ์—ด์„ 0์œผ๋กœ ์ดˆ๊ธฐํ™”ํ•ด์„œ ๋งŒ๋“ค์—ˆ๊ธฐ ๋•Œ๋ฌธ์—, x์ขŒํ‘œ y์ขŒํ‘œ๊ฐ€ ๋‘˜ ๋‹ค 1์ผ ๋•Œ๋Š” ๊ณ„์‚ฐ๋˜์ง€ ์•Š์•„์•ผํ•œ๋‹ค...!

๐ŸŽˆ๋ฌธ์ œ์—์„œ ์ œ์‹œํ•œ ์ถœ๋ ฅ์— ๋งž์ถฐ %1000000007์„ ํ•ด์ค€๋‹ค

๋Œ“๊ธ€