Discussion on Check Strict Superset Challenge

Sort 900 Discussions, By:

2 days ago+ 0 comments

set_a = set(map(int, input().split()))
n = int(input())
set_n = set()
for i in range(n):
    set_n.update(list(map(int, input().split())))
print(set_a.issuperset(set_n))

3 days ago+ 0 comments

s1 = set(map(int,input().split())) n = int(input()) s2 = set(map(int,input().split())) if s1.issuperset(s2): print(False) else: print(True)

    can anybody tell wher the problem is?

4 days ago+ 0 comments

def main():
    A = set(map(int, input().split()))
    
    s = set()
    
    n = int(input())
    for _ in range(n):
        B = set(map(int, input().split()))
        s.update(B)
        
    is_super_set = True
    
    for i in s:
        if i not in A:
            is_super_set = False
    
    print(is_super_set)

if __name__ == "__main__":
    main()

5 days ago+ 0 comments

if __name__ == '__main__':
    a = set(map(int, input().split(" ")))
    isit = True
    for _ in range(int(input())):
        other = set(map(int, input().split(" ")))
        if not a.issuperset(other):
           isit = False
           break
        
    print(isit)

7 days ago+ 0 comments

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

for _ in range(n): b=set(map(int,input().split())) if b.difference(A): print(False) break else: if A==A.intersection(b): print(False) break else: print(True)

Load more conversations