Submission #3014851


Source Code Expand

n = int(input())
P = [int(i) for i in input().split()]

memo = [set() for i in range(n+1)]

def dfs(i, score):
    if score in memo[i]:
        return 0
    elif i >= n:
        memo[i].add(score)
        return 1
    else:
        memo[i].add(score)
        return dfs(i+1, score) + dfs(i+1, score+P[i])

print(dfs(0, 0))

Submission Info

Submission Time
Task A - コンテスト
User qLethon
Language Python (3.4.3)
Score 2
Code Size 337 Byte
Status AC
Exec Time 176 ms
Memory 20840 KB

Judge Result

Set Name All
Score / Max Score 2 / 2
Status
AC × 5
Set Name Test Cases
All 00, 01, 02, 90, 91
Case Name Status Exec Time Memory
00 AC 17 ms 3060 KB
01 AC 55 ms 8692 KB
02 AC 176 ms 20840 KB
90 AC 17 ms 3064 KB
91 AC 17 ms 3060 KB