BICAKE - Birthday cake
|Wersja polska||English version|
John even on birthday solves mathematician prolems. As a good host he wants to cut the cake for guests personally so that everyone gets a one piece. He had a hard day (he had to write a long essay), that is why he wants to do as few cuts as possible to keep power for partying. The size of each piece of that cake is irrelevant because everyone has a different appetite and no one will be neglected. Write a program which will help John. The program must print the minumum number of cuts he must do.
The number of tests is unknown (John is very inquisitive and he likes to consider various options). Every test consists of a one number 0 < n < 8*1012 + 3*106 that is a number of guests.
For a given n print the number of straight cuts that divide the cake into n pieces.
|Dodane przez:||Adam Bąk|
|Limit czasu wykonania programu:||1s-5s|
|Limit długości kodu źródłowego||50000B|
|Cluster:||Cube (Intel G860)|
|Języki programowania:||All except: GOSU|