Bob is hosting a birthday party. He has called his friends and each friend will get a cake including bob so n cakes . there are m candles to be distributed among the cakes such that every cake has at least 1 candle and the difference in number of candles between any two neighbour is not greater than one . what can be the maximum number of candles bob can get. suppose bob is at kth(1-indexed) position . sample case n=6,m=28,k=5 then bob can get 6 candles at most
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | Kevin114514 | 3678 |
| 3 | VivaciousAubergine | 3647 |
| 4 | jiangly | 3582 |
| 5 | strapple | 3515 |
| 6 | tourist | 3473 |
| 7 | Radewoosh | 3418 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | turmax | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/23/2026 20:51:06 (g1).
Desktop version, switch to mobile version.
Supported by
write a mathematical function say x is given to bob the people at distance one is given x-1 then at 2 x-2 so on.