Skip to content

feat: solved 11051 이항계수2 - dp#129

Open
flowjiyun wants to merge 1 commit intomainfrom
97-2023115sun-바킹독-알고리즘-부수기-day39-1

Hidden character warning

The head ref may contain hidden characters: "97-2023115sun-\ubc14\ud0b9\ub3c5-\uc54c\uace0\ub9ac\uc998-\ubd80\uc218\uae30-day39-1"
Open

feat: solved 11051 이항계수2 - dp#129
flowjiyun wants to merge 1 commit intomainfrom
97-2023115sun-바킹독-알고리즘-부수기-day39-1

Conversation

@flowjiyun
Copy link
Contributor

n의 갯수가 많을 때
조합 nCk = n-1Ck-1 + n-1Ck

@flowjiyun flowjiyun linked an issue Feb 12, 2023 that may be closed by this pull request
1 task
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2023.1.15(SUN) 바킹독 알고리즘 부수기 (Day39)

1 participant