Birthday Chocolates Shopping


Description

Your birthday is coming, and to celebrate it, you want to give chocolates to all the students of your class. There are M students in your class, and you have N rupees to spend on the chocolates. Now, you can buy  "Dairy Milk", "Shots" or "Eclairs". The cost of Dairy Milk is 5 Rs per chocolate, and the cost of Shots is 2 Rs per chocolate, and the cost of Eclairs is 1 Rs per chocolate. You only have N rupees saved from your pocket money, and you want to buy the most expensive chocolate possible for your classmates.

Print "Dairy Milk", if you can buy M of them within N rupees, else if you can buy M Shots within N rupees, print "Shots", else if you can buy M eclairs within N rupees, print "Eclairs", else print "No Chocolates".

Input

The first line of input contains N, the amount of money you have. Next line contains M, the number of students in your class.


Constraints

1 <= N <= 200

1 <= M <= 100

Output

Print "Dairy Milk", if you can afford M of them within N rupees, else if you can buy M Shots within N rupees, print "Shots", else if you can buy M eclairs within N rupees, print "Eclairs", else print "No Chocolates".

Sample Input 1 

100
15

Sample Output 1

Dairy Milk

Sample Input 2 

10
15

Sample Output 2

No Chocolates

Hint

In the first sample test cases, you can buy 15 Dairy Milk chocolates, in 75 rupees, and you have 100 rupees to spend, so the answer will be "Dairy Milk".

In the second test case, you cannot buy any of the chocolates in the required quantity of 15, so the output is "No Chocolates"

Comments

Post a Comment

Popular posts from this blog

Multer file upload and delete - Nodejs, Mongodb, Express

Multer is a node.js middleware  which is primarily used for uploading files. Dependencies     "express" : "^4.17.1" ,     "mongoose" : "^6.0.9" ,     "multer" : "^1.4.3 Multer doc :  https://www.npmjs.com/package/multer Middleware required : Path and Multer Folder to upload file and name of a file. const storage = multer . diskStorage ({     destination : function ( req , file , cb ) {         cb ( null , path . join ( __dirname , '../uploads' )) //upload file in uploads folder       },       filename : function ( req , file , cb ){         const uniquePrefix = Date . now () + '-' + Math . round ( Math . random () * 1E9 )         cb ( null , uniquePrefix + '-' + file . originalname )   //uploaded file name     } }) Filter file types  const fileFilter = ( req , file , cb ) => {     // The function sho...
Read more

Money Management

  Description You have decided to manage your expenses. In order to do that, you have arranged all your bills in the form of an array. Your monthly salary is K Rs. If the total expenditure that you make is more than your salary, print "Debt". If the total expenditure is less than your monthly salary, then print "Save". If the expenditure is equal to your salary, print "Neutral". Input The first line of the input contains N, the number of elements in the array. Next line contains N space separated integers, denoting the expenses. Last line of the test case contains K, your monthly salary. Constraints 1 <= N < 100 1 <= A[i] <= 10 1 <= K <= 1000 Output Print the output as per the conditions mentioned in the problem statement. Sample Input 1  5 1 2 3 4 5 16 Sample Output 1 Save Sample Input 2  5 1 2 3 4 5 15 Sample Output 2 Neutral Hint In the first sample test case, the total expense was 15 Rs, and your salary is 16 Rs. Therefore, the output...
Read more

Sub array quest IX

Description Given an array A with N positive integers. Count the number of subarrays, such that for each subarray, the sum of odd numbers exceeds the sum of even numbers. Input First line: Single integer denoting the value of T - the number of test cases. For each test case: First line: Single integer denoting the value of N. Next line: N single space-separated integers denoting the elements of array A. Constraints: 1 <= T <= 100 1 <= N<= 100 Any array elements is not greater than 100. Output For each test case, print in a new line, a single integer denoting the number of subarrays. Sample Input 1  1 5 1 2 3 4 5 Sample Output 1 9 Hint Given test cases, Test 1: N = 5. A: 1 2 3 4 5. The following subarrays having more sum of odd numbers than the sum of even numbers : 1. 1 2. 1 2 3 3. 1 2 3 4 5 4. 2 3 5. 2 3 4 5 6. 3 7. 3 4 5 8. 4 5 9. 5 Hence the answer is 9. Answer: 
Read more