Submission #38215755

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def D(N, X, AB):
    seed = []
    for A, B in AB.items():
        seed += [A] * B
        
    def search(seed, target):
        numbers = set([0])
        
        for s in seed:
            for n in list(numbers):
                nxt = n + s
                if nxt == target: return True
                if nxt < target: numbers.add(nxt)
                
        return False
    return "Yes" if search(seed, X) else "No"
  
N, X = map(int, input().split())
AB = {}
for _ in range(N):
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def D(N, X, AB):
    seed = []
    for A, B in AB.items():
        seed += [A] * B
        
    def search(seed, target):
        numbers = set([0])
        
        for s in seed:
            for n in list(numbers):
                nxt = n + s
                if nxt == target: return True
                if nxt < target: numbers.add(nxt)
                
        return False

    return "Yes" if search(seed, X) else "No"
  
N, X = map(int, input().split())
AB = {}
for _ in range(N):
  A, B = map(int, input().split())
  AB[A] = B
  
print(D(N, X, AB))

Submission Info

Judge Result