Easy Problem-2 In a carnival, a person initially has N tickets. He can play one gam with each ticket. He earns 25 game coin
Easy Problem-2 In a carnival, a person initially has N tickets. He can play one gam with each ticket. He earns 25 game coins for every game. The person can buy a new ticket for every 100 gamecoins he earns Write a program that reads the tickets N the person initially ha prints the maximum number of games the person can play. Input The input will be a single line containing an integer representing the tickets the person initially has. N Output The output should be a single line containing an integer maximum number of games the person can play. Explanation For example, if the given tickets is N = 4 The person has 4 tickets, so he can play 4 gan . For each game, he earns 25 game coins. So, f earns 100 game coins.
Often have questions like this?
Learn more efficiently, for free:
