Chocolate Vending Machine - TCS NQT

Chocolate Vending Machine - TCS NQT 

Problem:

There is a chocolate vending machine which contains at most N chocolates. The chocolate vending machine is never remaining empty as when last K chocolates are left, the machine is refilled with new chocolates in such a way that the machine gets full. There are C customers numbered from 1 to C who want to buy some chocolates from the machine. The program must accept the values of N, K and C integers representing the number of chocolates that the C customers want to buy as the input. After processing each customer's request, the program must print the output based on the following conditions. - The program must print the string value "Customer: " followed by the customer's number. - If it is possible to sell the chocolates to a customer's request, the program must print the string value "Number of chocolates sold: " followed by the number of chocolates sold to the customer. Then the program must print the string value "Number of chocolates available: " followed by the number of chocolates remaining in the machine after the purchase. - Else the program must print the string value "Invalid" as the output. 

Boundary Condition(s): 

1 <= K <= N <= 1000 

1 <= C <= 100 

1 <= Each integer value <= N 

Input Format: 

The first line contains N and K separated by a space. The second line contains C. The third line contains C integers separated by a space. 

Output Format: 

For each customer, the first line contains the string value "Customer: " followed by the customer's number. The second line contains the string value "Invalid" or the string value "Number of chocolates sold: " followed by the number of chocolates sold to the customer as per the given conditions. The third line contains the string value "Number of chocolates available: " followed by the number of chocolates remaining in the machine after the purchase. 

Example Input/Output 1: 

Input: 

10 5 

4 

3 8 5 6 

Output: 

Customer: 1 Number of chocolates sold: 3 Number of chocolates available: 7 

Customer: 2 Invalid 

Customer: 3 Number of chocolates sold: 5 Number of chocolates available: 10 

Customer: 4 Number of chocolates sold: 6 Number of chocolates available: 10 

Explanation: 

Here N=10 and K=5. Initially the number of chocolates available in the vending machine is 10. The customer 1 wants to buy 3 chocolates. It is possible to sell 3 chocolates. Now the number of chocolates sold is 3 and the number of chocolates remaining is 7. The customer 2 wants to buy 8 chocolates. It is not possible to sell 8 chocolates because the vending machine has only 7 chocolates. The customer 3 wants to buy 5 chocolates. It is possible to sell 5 chocolates. Now the number of chocolates sold is 5 and the number of chocolates remaining is 2 which is less than K. So the machine is refilled with new chocolates (now the machine has 10 chocolates). The customer 4 wants to buy 6 chocolates. It is possible to sell 6 chocolates. Now the number of chocolates sold is 6 and the number of chocolates remaining is 4 which is less than K. So the machine is refilled with new chocolates (now the machine has 10 chocolates). 

Program:

total, refill = map(int, input().split())

n = int(input())

l = list(map(int,input().split()))

temp = total

for i in range(n):

    print("Customer:",i+1)

    if l[i] <= total:

        total -= l[i] 

        if total <= refill:

            total = temp

        print("Number of chocolates sold:",l[i])

        print("Number of chocolates available:",total)

    else:

        print("Invalid")

    

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