Notice
Recent Posts
Recent Comments
Link
목록11057 (1)
나의 개발일지
문제 : https://www.acmicpc.net/problem/11057 DP n = int(input()) dp = [[1] * n for _ in range(10)] for i in range(len(dp)): dp[i][0] = i+1 for i in range(1, len(dp[0])): for j in range(1, len(dp)): dp[j][i] = (dp[j-1][i] + dp[j][i-1]) % 10007 print(dp[-1][-1])
백준
2023. 10. 12. 16:01