do it in c++ as soon as possible. Skip if you don't know. Little Johnny Bubbles appreciates going through hours before his PC playing computer games. His #1 game is Bubble Strike, speedy air pocket shooting internet game for two players. Each game is set in one of the N maps, each having diverse landscape setup. First period of each game settles on which map the
Please do it in c++ as soon as possible. Skip if you don't know.
Little Johnny Bubbles appreciates going through hours before his PC playing computer games. His #1 game is Bubble Strike, speedy air pocket shooting internet game for two players.
Each game is set in one of the N maps, each having diverse landscape setup. First period of each game settles on which map the game will be played. The game framework arbitrarily chooses three guides and shows them to the players. Every player should pick one of those three guides to be disposed of. The game framework then, at that point, arbitrarily chooses one of the guides that were not picked by any of the players and starts the game.
Johnny is profoundly energetic with regards to the game and needs to invest some energy concentrating on maps, in this manner expanding opportunities to dominate matches played on those guides. Nonetheless, he likewise needs to get his work done, so he doesn't have the opportunity to concentrate on every one of the guides. That is the reason he asked himself the accompanying inquiry: "What is the base number of guides I need to contemplate, so the likelihood to play one of those guides is essentially P"? Would you be able to assist Johnny with discovering the response for this inquiry? You can accept that Johnny's adversaries don't have any acquaintance with him, and they will haphazardly pick maps.
Input: The primary line contains two whole numbers N (3 ≤ N ≤ 103) and P (0 ≤ P ≤ 1) – complete number of guides in the game and likelihood to play map Johnny has considered. P will have all things considered four digits after the decimal point.
Output:Yield contains one whole number – least number of guides Johnny needs to contemplate.
Step by step
Solved in 3 steps with 1 images
