The list of room numbers contains 31 elements. Since K is 5, there must be 6 groups of families. In the given list, all of the numbers repeat 5 times except for. In this series, I will share the code of HackerRank's Python problems. 38 The Captain's Room Problem Solution · 39 Checking Subset in Python. This is the problem in hackerrank. I sloved it using couple bltadwin.ru,first time it passed test case 0 but not fully submitted cause other. · The Captain's Room, is a HackerRank problem from Sets subdomain. In this post we will see how we can solve this challenge in Python. Problem Description. Mr. Anant Asankhya is the manager at the INFINITE hotel. The hotel has an infinite amount of rooms. One fine day, a finite number of tourists come to stay at the hotel. · Print output to STDOUT # The Captains Room in python - Hacker Rank Solution START N = int (input ()) storage = map (int, input (). split()) storage = sorted (storage) for i in range (len (storage)): if (i!= len (storage)-1): if (storage[i]!= storage[i-1] and storage[i]!= storage[i + 1]): print (storage[i]) break; else: print (storage[i]) # The Captains Room in python - Hacker Rank Solution ENDEstimated Reading Time: 2 mins. · The Captain's Room - Hacker Rank Solution Mr. Anant Asankhya is the manager at the INFINITE hotel. The hotel has an infinite amount of rooms. One fine day, a finite number of tourists come to stay at the hotel. The tourists consist of: → A Captain. → An unknown group of families consisting of members per group where ≠.Estimated Reading Time: 2 mins.
0コメント