Submission #35924245

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
def D(N, K, A):
    dp = [0] * (N + 1)
    
    for i in range(N + 1):
        for a in A:
            if a > i: break
            dp[i] = max(dp[i], i - dp[i - a])
    return dp[N]
 
N, K = map(int, input().split())
*A, = map(int, input().split())
print(D(N, K, A))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def D(N, K, A):
    dp = [0] * (N + 1)
    
    for i in range(N + 1):
        for a in A:
            if a > i: break
            dp[i] = max(dp[i], i - dp[i - a])
    return dp[N]
 
N, K = map(int, input().split())
*A, = map(int, input().split())
print(D(N, K, A))

Submission Info

Judge Result