## Day 1 - Slot 1 (8 AM to 11 AM)

#### Question 1 :

Selection of MPC'S exams include a fitness test which is conducted on ground. There will be a batch of 3 trainees, appearing for running test in track for 3 rounds. You need to record their oxygen level after every round. After trainee are finished with all rounds, calculate for each trainee his average oxygen level over the 3 rounds and select one with highest oxygen level as the most fit trainee. If more than one trainee attains the same highest average level, they all need to be selected. Display the most fit trainee (or trainees) and the highest average oxygen level.

*Note:*

*Example 1:*

95

92

95

92

90

92

90

92

90

OUTPUT VALUES

Trainee Number : 1

Trainee Number : 3

*Note:*

Input should be 9 integer values representing oxygen levels entered in order as

Round 1

Oxygen value of trainee 1

Oxygen value of trainee 2

Oxygen value of trainee 3

Round 2

Oxygen value of trainee 1

Oxygen value of trainee 2

Oxygen value of trainee 3

Round 3

Oxygen value of trainee 1

Oxygen value of trainee 2

Oxygen value of trainee 3

Output must be in given format as in above example. For any wrong input final output should display “INVALID INPUT”

#### Answer

Output

#### Question 2 :

There is a JAR full of candies for sale at a mall counter. JAR has the capacity N, that is JAR can contain maximum N candies when JAR is full. At any point of time. JAR can have M number of Candies where M<=N. Candies are served to the customers. JAR is never remain empty as when last k candies are left. JAR if refilled with new candies in such a way that JAR get full. Write a code to implement above scenario. Display JAR at counter with available number of candies. Input should be the number of candies one customer can order at point of time. Update the JAR after each purchase and display JAR at Counter. Output should give number of Candies sold and updated number of Candies in JAR. If Input is more than candies in JAR, return: “INVALID INPUT”

Given,

N=10, where N is NUMBER OF CANDIES AVAILABLE

K =< 5, where k is number of minimum candies that must be inside JAR ever.

*Example 1:(N = 10, k =< 5)*

Input Value

3

Output Value

NUMBER OF CANDIES SOLD : 3

NUMBER OF CANDIES AVAILABLE : 7

*Example : (N=10, k<=5)*

Input Value

0

Output Value

INVALID INPUT

NUMBER OF CANDIES LEFT : 10

## 0 Comments