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

|

1106 Discussions

|

  • n4m774r_d
     + 0 comments
    A = set(input().split())
print(all( A>= set(input().split())for _ in range(int(input()))))

  • mohammedmahboob1
     + 0 comments
        A = set(map(int, input().split()))
    n = int(input())
    Flag=True
    for _ in range(n):
        s1 = set(map(int, input().split()))
        if A.issuperset(s1) and len(A)>len(s1):
            continue
        else:
            Flag = False
    
    print(Flag)

  • akhilkeeprathy
     + 0 comments

    A_set=set(map(int, input().split())) n=int(input()) flag=True for i in range(n): B=set(map(int, input().split())) if not A_set.issuperset(B): flag=False continue print(flag)

  • namnika_janband1
     + 0 comments
    setA = set(input().split())
t = int(input()) 
count = 0

for _ in range(t):
    a = set(input().split())
    if setA.issuperset(a):
       count += 1
print(count == t)

  • parantika_ghosh1
     + 0 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)