Submission #11376499
Source Code Expand
N = int(input()) p = list(map(int, input().split())) sum_p = int(sum(p)) dp = [[0]*(sum_p+1) for i in range(N)] for i in range(N): dp[i][0]=1 for i in range(N): for j in range(1,sum_p+1): if i>0 and dp[i-1][j]==1: dp[i][j]=1 if j>=p[i] and dp[i-1][j-p[i]]==1: dp[i][j]=1 print(sum(dp[-1]))
Submission Info
Submission Time | |
---|---|
Task | A - コンテスト |
User | mikittt |
Language | PyPy3 (2.4.0) |
Score | 2 |
Code Size | 365 Byte |
Status | AC |
Exec Time | 196 ms |
Memory | 44656 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 2 / 2 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00, 01, 02, 90, 91 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00 | AC | 177 ms | 39152 KB |
01 | AC | 184 ms | 41200 KB |
02 | AC | 196 ms | 44656 KB |
90 | AC | 186 ms | 38256 KB |
91 | AC | 165 ms | 38256 KB |