baekjoon (1) 썸네일형 리스트형 [C/C++] BOJ #1038 - Decreasing Number This problem is one I solved back when I was working through a lot of Baekjoon problems. At that time, I used to solve around 20 problems a day, but now the difficulty level of the problems has increased, and they require more thinking, so I can’t solve as many anymore.A “decreasing number” is a number where the digits strictly decrease, such as 31, 7543, or 941. The goal is to list all such num.. 이전 1 다음
