Check Subset

Sort by

recency

|

921 Discussions

|

  • + 0 comments

    n = int(input()) for i in range(n): n1 = int(input()) a = set(map(int,input().split())) n2 = int(input()) b = set(map(int,input().split())) c = a.intersection(b) if a == c: print('True') else: print('False')

  • + 0 comments
    def check_subset(test_cases):
        results = []
        for case in test_cases:
            setA_n, setA, setB_n, setB = case
            subset = True
            if setA_n > setB_n:
                subset = False
            else:
                subset = set(setA).issubset(set(setB))
    
            results.append("True" if subset else "False")
    
        return results
    
    # Read input
    def main():
        import sys
        input = sys.stdin.read
        data = input().strip().split("\n")
    
        T = int(data[0])
        test_cases = []
    
        for i in range(1, 4 * T, 4):
            setA_n = int(data[i])
            setA = data[i + 1].split()
            setB_n = int(data[i + 2])
            setB = data[i + 3].split()
            
            test_cases.append((setA_n, setA, setB_n, setB))
    
        results = check_subset(test_cases)
    
        for result in results:
            print(result)
    
    if __name__ == "__main__":
        main()
    
  • + 0 comments

    t=int(input()) for _ in range(t): n=int(input()) set_a=set(map(int,input().split())) m=int(input()) set_b=set(map(int,input().split())) print(set_a.issubset(set_b))

  • + 0 comments

    n = int(input())

    for i in range(n):

    set_a_ele_num = int(input())
    
    set_a = set(input().split())
    
    set_b_ele_num = int(input())
    
    set_b = set(input().split())
    
     print(set_a.issubset(se
        t_b))
    
  • + 0 comments
    for _ in range(int(input())):
        input(); a = set(map(int, input().split()))
        input(); b = set(map(int, input().split()))
        print(a.issubset(b))
    

    a slightly more compact code