Shortest & Second Shortest Distance

Shortest & Second Shortest Distance - TCS DIGITAL

Problem: 

There are N paths to travel from the city A to the city B. The distance of each path is passed as the input to the program. The program must print the shortest distance and the second shortest distance among the given N distances as the output. If all the distances are equal, then the program must print the string value "Equal" as the output. 

Boundary Condition(s): 

2 <= N <= 100 

1 <= Distance of each path <= 10^8 

Input Format: 

The first line contains N. The next N lines, each contains an integer value representing the distance of each path from the city A to the city B. 

Output Format: 

The first line contains the shortest distance and the second shortest distance among the given N distances separated by a space or the first line contains a string value "Equal". 

Example Input/Output 1: 

Input: 

5 

400 

100 

500 

200 

300 

Output: 

100 200 

Explanation: Here N=5, the distance of each path from the city A to the city B are given below. 400 100 500 200 300 The distance 100 is the shortest distance and 200 is the second shortest distance. So 100 200 is printed. 

Example Input/Output 2: 

Input: 

4 

45 

20 

65 

20 

Output: 

20 45 

Example Input/Output 3: 

Input: 

6 

75 

75 

75 

75 

75 

75 

Output: 

Equal

Program:

n = int(input()) 

l = []

for i in range(n): 

    l.append(int(input()))

l = sorted(set(l))[::-1] 

if len(l) == 1:

    print("Equal")

else:    

    print(l[-1],l[-2])    

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more