Computer Science, asked by manasarepakula, 6 months ago

ONLINE DIOS
Maximum Prize
- Problem Description
Imagine you are a martial arts fighter fighting with fellow martial artists 10 win prize money However unlike traditional competitions, here you have the opportunity to preko ho
opponent to makete your pruze kitty The rules of maximization of prize kitty are as follows
You have a superpower bestowed upon you, that you will win against anyone you challenge
You have to choose the right onder because unfortunately the superpower does not ensure that your prize money is always the highest
Every victory against an opponent that you chudlenge and win against will translate into a certain winning sun
Hese begins the technical part that you need to know in order to mame your prize money
All your opponents are standing one lined to each other ie the order of opponents is fixed
Your first task is to choose a suitable opponent from the line
When you choose one opponent from that in the steps out of the time and fits you
meghbours
After you best you get to how your prize money for winning against he will be calculated
Essentially if the opponere you have been has two neglbours, then you have the option to multiply the one sumber with any one of the
onetter That value becomes your prize money for that match
fyour opponent has only one rehber then your prize money for that match is product of current ponenter with regnboursement
when dealing with last apparent the tournament your page money is equal to the value of the last posent number
As the nament proceeds the opponent that you have beaten bas to leave the tournament
2587​

Answers

Answered by jesunioluwa14
0

Answer:it gives 2587(2*1)

Explanation:why did I choose that answer it is because any person that comes to challenge you can come single multiple or triple folds

Similar questions