Raj has to travel from City A to City B separated by N km. He has three modes of transport
commute between the two cities.
The transport mode details are as below:
Bus - 1 Rs/km
Auto - 2 Rs/km
Cab - 3 Rs/km
He has only M Rs. with him.
Write an algorithm/pseudocode to find the number of different ways in which he can travel
A to city B costing less than or equal to
M rupees.
Answers
Answered by
0
Step-by-step explanation:
B is your answer mate.......
Similar questions