Three friends went to hotel for breakfast . After having breakfast total bill was Rs 25 . Each one contributed Rs 10. So total was Rs 30 . 30 is paid. waiter gave Rs 5 back to them . Three friend gave Rs 2 tips to waiter . From remaining Rs 3 each one took one rupee. As each one contributed ten . And each friend recieved one rupee back. Means each one had breakfast in nine rupee. So three friend had breakfast in 9+9+9=27. And Rs 2 is given to tips to waiter. So total money for breakfast for three friend was 27+2=29. Where is remaining one rupee?
Answers were Sorted based on User's Feedback
Answer / balu
bill amount : 25/- given each one 10/-
Divide 25/3=8.333/- then
each plate : 8.333/-
Balance return :5/- tip amt:2/- = rs 2/3people=0.667/-
each one given tip: 0.667/-
rest of money=3/- balance amt rs3/3people
each one divide like this
total: 8.333+0.667+1
| Is This Answer Correct ? | 89 Yes | 55 No |
Answer / shubh
Its only a type of asking of a question..
As total amount of breakfast=25
They given=30
They get back=5
Tip =2
Each one get back 1 rupee
Thus total amount =25+3+2=30
Hence Its solve
| Is This Answer Correct ? | 46 Yes | 24 No |
Answer / kamal
Expenses-
Bill = 25
Tip = 2
Total expenses = 25+2 = 27
Paid = 30
each took 1 total 1+1+1=3
30-27 = 3, or 27+3 = 30
Isn’t it simple.
| Is This Answer Correct ? | 11 Yes | 6 No |
Answer / steve k
Having taken back Rs 1, each has paid Rs 9
9 * 3 = 27 paid which is Rs 25 for the meal + the Rs 2 tip, no money missing
| Is This Answer Correct ? | 15 Yes | 21 No |
the total cost for breakfast is Rs. 25. So each frnd has to
pay 25/3 = 8.333.
now they gave total Rs. 2 as tip. So, contribution of each
of the frnd is 2/3 = 0.66.
So, total cost for 1 frnd is Rs. (8.33+0.66) = 9 and they
all got Rs. 1 back.
| Is This Answer Correct ? | 13 Yes | 21 No |
A tank can be filled by pipe A in 30 minutes and by pipe B in 24 minutes. Outlet pipe C can empty the full tank in X minutes. If the tank is empty initially and if all the three pipes A, B and C are opened simultaneously, the tank will NEVER be full. Give the maximal possible value of X.
Q16. A sheet of paper has statements numbered from 1 to 40. For all values of n from 1 to 40, statement n says: 'Exactly n of the statements on this sheet are false.' Which statements are true and which are false?
i want model paper on SBI Clerk post,plz sed previous papers
0 Answers State Bank Of India SBI,
What is the remainder left after dividing 1! + 2! + 3! + ? + 100! By 7?
1) You have 8 coins. 3 of them weigh x units, 3 y units, 1 a units and 1 b units. They are all mixed and look identical. You have to find the lightest coin in minimum number of weighing .
9 Answers Bhel, Mechanical, Microsoft, Oracle,
In which month child has been less weeping?
can anyone provide the answer for the puzzle below There are 25 horses,in each race only 5 horses can participate.how many races are required to select best 5 horses out of 25. need answer with detailed explanation
Consider a chessboard with a single Rook. A Rook can move any number of square sideways/forward, but not diagonally. What is the minimum number of moves the Rook needs to make, in order to pass over all the squares on the chessboard and return to the original position?
Substitute digits for the letters to make the following addition problem true. W H O S E T E E T H A R E + A S ------------------- S W O R D S Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter H, no other letter can be 3 and all other H in the puzzle must be 3.
give me an some aptitude question asked on interviews
a is person take 10 days to do a work, b is a person take 15 days to do same work, if both do the work how many days will they take
Given a sequence of integers, there are a few sequences which result in balanced binary search trees i.e., AVL trees. Write a program that takes a sequence of integers as input and outputs the number of such sequences that result in the balanced binary search trees. Input Format: Single line contains sequence of integers terminated by -1. Output format: Print the number of AVL tree possible from that input sequence. Sample Input: 1 2 3 -1 Sample Output: 2