Physical Fitness - TCS NQT

Physical Fitness -  TCS NQT 

Problem:

A physical fitness test (running test) is conducted to select candidates for military training in a country. A batch of 3 candidates appearing for the running test on track for 3 rounds. The program must accept 9 integers indicating the oxygen level after each round for 3 candidates as the input. For each candidate, the program must calculate the average oxygen level over the 3 rounds. The candidate who has the highest average oxygen level is the most fit candidate. The program must print the string value "Candidate Number: " followed by the most fit candidate's number as the output. If more than one trainee attains the same highest average level, they all need to be printed. 

Boundary Condition(s): 1 <= Oxygen level <= 100 

Input Format: The first 3 lines, each contains an integer representing the oxygen level of the 3 candidates after the round 1. The middle 3 lines, each contains an integer representing the oxygen level of the 3 candidates after the round 2. The last 3 lines, each contains an integer representing the oxygen level of the 3 candidates after the round 3. 

Output Format: The line(s), each contains the string value "Candidate Number: " followed by the most fit candidate's number. 

Example Input/Output 1: 

Input: 

96 93 96 93 91 93 91 93 91 

Output: 

Candidate Number: 1 

Candidate Number: 3 

Explanation: 

The oxygen level of candidate 1 after each round is 96 93 91 The oxygen level of candidate 2 after each round is 93 91 93 The oxygen level of candidate 3 after each round is 96 93 91 The average oxygen level of each candidate is 93.33, 92.33 and 93.33. 

Here the candidate 1 and the candidate 3 have the highest average oxygen level. 

Hence the output is 

Candidate Number: 1 

Candidate Number: 3 

Example Input/Output 2: 

Input: 

92 86 95 85 85 87 82 82 82 

Output: 

Candidate Number: 3

Program:

candidate = [0, 0, 0]

for i in range(9): 

    oxygen_level = int(input())

    candidate[i%3] += oxygen_level 

for i in range(3):

    if candidate[i] == max(candidate): 

        print("Candidate Number:",i+1)

        

    

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

Grouping Colorful LEDs - Accenture

Grouping Colorful LEDs - Accenture Problem: The program must accept the names of the colors in an LED serial set as the input. The program must find the number of groups of LEDs having the same color at the beginning and the end in the given LED serial set. Also consider each LED in the given LED serial set as a group. Finally, the program must print the number of groups of LEDs as the output. Input 1: Red Blue Green Blue Output 1: 5 Input 2: Yellow Red Yellow Green Blue Yellow Green Output 2: 11 Program: color = input().split()  count = 0 for i in range(len(color)):     if color[i] in color[i+1:]:          count  +=  color[i+1:].count(color[i]) print(count + len(color))     Explanation:  1. Accept a list of color names.  2. Iterate through the list and find the count of each color from the position next to the current position. Since to cover all the possible sublists that start and end with the same color. 3. ...
Read more