Check Subset

Sort by

recency

|

965 Discussions

|

  • + 0 comments

    T = int(input()) for i in range(T): n1 = int(input()) A = set(map(int,input().split())) n2 = int(input()) B = set(map(int,input().split())) if A == A.intersection(B): print("True") else: print("False")

  • + 0 comments
        for i in range(int(input())):
            int(input())
            A = set(map(int,input().split()))
            int(input())
            B = set(map(int,input().split()))
            if len(B) == len(A|B):
                print("True")
            else:
                print("False")
    
  • + 0 comments

    T = int(input())

    for i in range(T): setA_cnt = int(input()) A = set(map(int,input().split())) setB_cnt = int(input()) B = set(map(int,input().split())) z = A.issubset(B) print(z)

  • + 1 comment

    def setss(): test_case = int(input())

    for j in range(test_case):
        emp = True
        int(input())
        ISET_A = list(map(int, input().split()))
        int(input())
        ISET_B = list(map(int, input().split()))
        for i in ISET_A:
            if i not in ISET_B:
                emp = False          
        print(emp)
    

    setss()

  • + 0 comments

    num_test_cases = int(input())

    for _ in range(num_test_cases):

    num_in_set_a = int(input())
    set_a = set(list(map(int, input().split())))
    num_in_set_b = int(input())
    set_b = set(list(map(int, input().split())))
    
    print(set_a.issubset(set_b))