'Happy Birthday' problem codeforces

I am not able to build a logic.
Link - https://codeforces.com/problemset/problem/1250/H

@yuvi2701
You need to find the integer with the least number of candles
Let it be x and count be y
then print x y+1 times
if x is 0
Then you will have to print 1 then y+1 times 0
In case of ties print then number with lower magnitude

Understood
Thank you

1 Like