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

|

1177 Discussions

|

  • nice00guy69
     + 0 comments

    But this is possible with a heck lot of parantheses

    SETA = set(map(int, input().split()))

print(all(SETA > set(map(int, input().split())) for _ in range(int(input()))))

  • nice00guy69
     + 0 comments

    I prefer this

    SETA = set(map(int, input().split()))

if all(SETA > set(map(int, input().split())) for _ in range(int(input()))):
    print(True)
else:
    print(False)

  • ngocyenle08
     + 0 comments
    A = set(input().split())
N = int(input())

print(all(A.issuperset(input().split()) for _ in range(N)))

  • lienquanaovacc1
     + 0 comments

    setA = set(input().split()) n = int(input()) for _ in range(n): subset = set(input().split()) if subset.issubset(setA) == False or (subset.issubset(setA) == True and len(subset) == len(setA)) : print(False) break else: print(True)

  • SVVBathini_w
     + 0 comments

    For Python3 Platform

    A = set(map(int, input().split()))
n = int(input())

for _ in range(n):
    B = set(map(int, input().split()))
    
    if(not(A > B)):
        print(False)
        break
else:
    print(True)