Computer Science, asked by shivamsharma50147, 4 months ago

TINTIN (100 MARKS)
Professor Calculus was working with the government on an important project. The aim of the project was to make a shark submarine which would help the government to work in the areas which were highly dominated by the sharks. The enemies got to know about it and they had kidnapped Professor Calculus.







image source: google



The government is searching for him and has also informed Tintin and detectives (Thomson and Thompson). Tintin and Snowy are preparing to search for Professor Calculus. Tintin has also informed everything to Captain Haddock and his first response is - “Blistering Barnacles”. They all are set to pay a visit to different cities to search for Professor. They can only do two things while paying visits to different cities:

Search for Professor

Take Rest





image source: google



A visit can be of a single or multiple days. During a visit, they cannot take rest for two days consecutively. Tintin has selected a range of minimum (M) and maximum (X) number of days required to search for the Professor. Tintin wants to select V different visits between the minimum and the maximum number of days (both inclusive). The only condition is that the visits should be of the same duration (number of days). Tintin is very busy with making all the preparations and needs your help. He wants you to tell him the number of ways of selecting the V different visits following the conditions so that he can plan more accurately and pace up the search.



Can you help him in planning and searching Professor Calculus?

Note: Since the number of ways can be large, print the answer modulo 10^9+7

Answers

Answered by Dhanishka8I2020
0

Answer:

₱ⱡɇ₳₴ɇ ₳₦₴ ₮ⱨł₴ qʉɇ₴₮łø₦

Similar questions