Water Tank & Buckets TCS NQT

Water Tank & Buckets TCS NQT 

Problem:

There is a water tank with the maximum capacity of X litres and a bucket with the maximum capacity of Y litres. A boy wants to fill greater than or equal to 80% of the water tank with the water using the bucket. The amount of water taken at a time in the bucket is not fixed as it can be any value less than or equal to Y. The program must accept the values of X, Y and a list of integers representing the amount of water taken in the buckets to fill the water tank. The program must print the number of buckets B poured into the water tank to reach greater than or equal to 80% of water. If it is not possible to fill 80% of the water tank, the program must print the string value "TANK NOT FULL" as the output. 

Boundary Condition(s): 

1 <= Y <= X <= 1000 

Input Format: 

The first line contains X. The second line contains Y. The line(s), each contains an integer representing the amount of water taken in the bucket. 

Output Format: 

The first line contains B or the string value "TANK NOT FULL". 

Example Input/Output 1: 

Input: 

100 20 20 15 10 20 20 20 

Output: 

5 

Explanation: 

Here the maximum capacity of a tank is 100 litres and the maximum capacity of a bucket is 20 litres. The amount of water taken in the buckets to fill the water tank are 20, 15, 10, 20, 20 and 20. After pouring the first 5 buckets of water into the tank. The tank contains 85 (20+15+10+20+20) litres of water which is greater than 80% of its capacity. Hence the output is 5. 

Example Input/Output 2: 

Input: 

150 50 10 20 50 10 10 

Output: 

TANK NOT FULL 

Example Input/Output 3: 

Input: 

100 10 10 10 10 10 10 10 10 10 

Output: 

8

Program:

x = int(input()) 

y = int(input()) 

tot = 0

count = 0 

while 1:

    try: 

        water = int(input())

        tot += water 

        count += 1 

        if tot/x >= 0.8:

            print(count)

            break

    except:

        if tot/x >= 0.8:

            print(count)

        else:

            print("TANK NOT FULL")

        break

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