False<\/code>.<\/p>\n\n\n\nA strict superset has at least one element that does not exist in its subset.<\/p>\n\n\n\n
Example<\/strong>
Set ([1 , 3, 4])<\/strong> is a strict superset<\/em> of set ([1 , 3])<\/strong>.
Set ([1 , 3, 4])<\/strong> is not a strict superset<\/em> of set ([1 , 3, 4])<\/strong>.
Set ([1 , 3, 4])<\/strong> is not a strict superset<\/em> of set ([1 , 3, 5])<\/strong>.<\/p>\n\n\n\n<\/span>Input Format<\/strong><\/span><\/h2>\n\n\n\nThe first line contains the space separated elements of set A<\/em><\/strong>.
The second line contains integer n<\/em><\/strong>, the number of other sets.
The next n<\/em><\/strong> lines contains the space separated elements of the other sets.<\/p>\n\n\n\n<\/span>Constraints<\/strong><\/span><\/h2>\n\n\n\n- 0 < len<\/em>(set<\/em>(A<\/em>)) < 501<\/strong><\/li>
- 0 < N<\/em> < 21<\/strong><\/li>
- 0 < len<\/em>(<\/strong>otherSets<\/strong><\/em>) < 101<\/strong><\/li><\/ul>\n\n\n\n
<\/span>Output Format<\/strong><\/span><\/h2>\n\n\n\nPrint True<\/code> if set A<\/em><\/strong> is a strict superset<\/em> of all other N<\/em><\/strong> sets. Otherwise, print False<\/code>.<\/p>\n\n\n\nSample Input 0<\/strong><\/p>\n\n\n\n1 2 3 4 5 6 7 8 9 10 11 12 23 45 84 78\n2\n1 2 3 4 5\n100 11 12<\/code><\/pre>\n\n\n\nSample Output 0<\/strong><\/p>\n\n\n\nFalse<\/code><\/pre>\n\n\n\nExplanation 0<\/strong><\/p>\n\n\n\nSet A<\/em><\/strong> is the strict superset<\/em> of the set ([1, 2, 3, 4, 5])<\/strong> but not of the set ([100, 11, 12])<\/strong> because 100<\/strong> is not in set A<\/em><\/strong>.
Hence, the output is False<\/code>.<\/p>\n\n\n\n<\/span>Solution – Check Strict Superset in Python <\/strong><\/span><\/h2>\n\n\n\n# Enter your code here. Read input from STDIN. Print output to STDOUT\nA = set(input().split())\nCOUNT = 0\nVALUE = 0\n\nfor i in range(int(input())):\n if A.issuperset(set(input().split())):\n COUNT += 1\n else:\n VALUE += 1\nif VALUE != 0:\n print('False')\nelse:\n print('True')<\/pre>\n\n\n\n