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

|

1562 Discussions

|

  • lakshyagoyal_di1
     + 0 comments

    Enter your code here. Read input from STDIN. Print output to STDOUT

    k = int(input()) l = list(map(int,input().split())) l.sort()

    for i in range(0,len(l)-1,k): if l[i] != l[i+4]: break

    else:
    i = len(l) - 1

    print(l[i])

  • Ryoushi887
     + 0 comments
    from collections import Counter
k = int(input())
CountedList = Counter(list(map(int,input().split())))
for room,freq in CountedList.items():
    if freq == 1:
        print(room)

  • nice00guy69
     + 0 comments

    I am just going to leave this here. I got the formula for finding the answer by shere cheating. Like I am super bad at Math

    K, ROOMS = int(input()), list(map(int, input().split()))
print((K*sum(set(ROOMS)) - sum(ROOMS))//(K-1))

  • sripavanvannam
     + 0 comments

    input_value=int(input())

    dist={}

    taken_list=list(map(int,input().split()))

    for i in taken_list:

        dist[i]=dist.get(i,0)+1

    for k,j in dist.items():

        if j==1:

         print(k)

  • SVVBathini_w
     + 0 comments

    For Python3 Platform

    K = int(input())
room_numbers = [*map(int, input().split())]
unique_rm = set(room_numbers)

for room_number in unique_rm:
    room_numbers.remove(room_number)
    
    if(room_number not in room_numbers):
        print(room_number)
        break