Examining the Rooms Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1138 Accepted Submission(s): 686 Problem Description A murder happened in the hotel. As the best detective in the town, yo
Count the Buildings Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1249 Accepted Submission(s): 408 Problem Description There are N buildings standing in a straight line in the City, numbere
Examining the Rooms Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1661 Accepted Submission(s): 1015 Problem Description A murder happened in the hotel. As the best detective in the town, yo
Find the Permutations Sorting is one of the most used operations in real life, where Computer Science comes into act. It is well-known that the lower bound of swap based sorting is nlog(n). It means that the best possible sorting algorithm will take