We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
sett = set(map(int, (input().split())))
n = int(input())
check = True
for _ in range(n):
subset = set(map(int, (input().split())))
for j in subset:
if j not in sett:
check = False
break
print(check)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Check Strict Superset
You are viewing a single comment's thread. Return to all comments →
time complexity n2
sett = set(map(int, (input().split()))) n = int(input()) check = True for _ in range(n): subset = set(map(int, (input().split()))) for j in subset: if j not in sett: check = False break print(check)