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. The Captain's Room
  5. Discussions

The Captain's Room

Sort by

recency

|

1547 Discussions

|

  • arthur_frachon
     + 0 comments
    K, liste = int(input()),  list(map(int, input().split()))
rooms = set(liste)
listeAdj = liste.copy()
for elmt in rooms:
    listeAdj.remove(elmt)
print(list(rooms.symmetric_difference(set(listeAdj)))[0])

  • k_santoshreddy21
     + 0 comments
    from collections import Counter as counter

if __name__ == "__main__":
    
    K = int(input())
    L = counter(map(int, input().split()))
    print(L.most_common(len(L))[-1][0])

  • dilajevolves
     + 1 comment
    # Enter your code here. Read input from STDIN. Print output to STDOUT
K,entries = int(input()),list(map(int,input().split()))
print((sum(set(entries))*K-sum(entries))//(K-1))

  • trones_de
     + 0 comments

    not sure what is trrying to be taught about sets here... with counter or dict/hashmap it's simple:

    lines = sys.stdin.read().splitlines()

k = lines[0]
rm_number_counts = {}
for i in lines[1].split(' '):
    if i not in rm_number_counts:
        rm_number_counts[i] = 1
    else:
        rm_number_counts[i] += 1

for k, v in rm_number_counts.items():
    # print(k , v)
    if v == 1:
        print(k)

  • Adavidguevara1
     + 0 comments
    from collections import Counter

k, A = input(), list(map(int, input().split()))
for item in dict(Counter(A)).items():
    if item[1] == 1:
        print(item[0])