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.
  1. Prepare
  2. Python
  3. Sets
  4. Check Strict Superset
  5. Discussions

Check Strict Superset

Sort by

recency

|

1172 Discussions

|

  • andepavan37
     + 0 comments
    set_A = set(map(int,input().split()))
n = int(input())
res = []
for _ in range(n):
    set_B = set(map(int,input().split()))
    flag = set_A.issuperset(set_B)
    res.append(flag)
print(all(res))

  • dheenupriya2001
     + 0 comments
    A = set(map(int, input().split()))
n = int(input())
res = True
for _ in range(n):
    B = set(map(int, input().split()))
    if not (A.issuperset(B) and A != B):
        res = False
        break
print(res)

  • patilprathames25
     + 0 comments

    set_A = set(map(int,input().split())) n_numbers = int(input()) flages = True for _ in range(n_numbers): set_n = set(map(int,input().split()))

    if not set_A > set_n:
    flages = False

    print(flages)

  • jondornback
     + 0 comments

    Here's my solution that does not require an additional data structure to track the results of each comparison. This may be preferable when you do not want the additional memory overhead as well as the additional loop over the results. This also ends the main loop faster as it can exit as soon as any False is found. 

    s = set(map(int,input().split()))
n = int(input())
allsupersets = True
for _ in range(n):

    s1 = set(map(int,input().split()))
    if not s.issuperset(s1):
        allsupersets = False
        break
print(allsupersets)

  • satyasouravssp0
     + 0 comments
    A=set(input().split())
n=int(input())
temp = []
for i in range(n):
    B=set(input().split())
    if (A.issuperset(B)):
        temp.append("True")
    else:
        temp.append("False")
if "False" in temp:
    print("False")
else:
    print("True")