Имя: Пароль: Зарегистрироваться Восстановить пароль
28/01/2023 15:41:31

# Рабочее место участника

## Задачи

101. The Hotel with Infinite Rooms

Ограничения: время – 1s/2s, память – 32MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод
Послать решение Blockly Посылки Темы Где Обсудить (0)

The city of Binvolution has a strange hotel with infinite rooms. The groups that come to this hotel follow the following rules:
• At the same time only members of one group can rent the hotel.
• Each group comes in the morning of the check-in day and leaves the hotel in the evening of the check-out day.
• Another group comes in the very next morning after the previous group has left the hotel.
• A very important property of the incoming group is that it has in two times more members than its previous group unless it is the starting group. You will be given the number of members of the starting group.
• A group with n members stays for n days in the hotel. For example, if a group of four members comes on 1st August in the morning, it will leave the hotel on 4th August in the evening and the next group of eight members will come on 5th August in the morning and stay for eight days and so on.
Given the initial group size you will have to find the group size staying in the hotel on a specified day.
Input
The input contains round numbers S\ (1\ ≤\ S\ ≤\ 100) and D\ (1\ ≤\ D\ ≤\ 10^9) in every line. S denotes the initial size of the group and D denotes that you will have to find the group size staying in the hotel on Dth day (starting from 1). A group size S means that on the first day a group of S members come to the hotel and stays for S days then comes a group of 2*S members according to the previously described rules and so on.
Output
For each line of input, print on a single line the size of the group staying in the hotel on the Dth day.

Sample Input

1 6
3 9
3 14


Sample Output

4
6
12