Logo
(追記) (追記ここまで)

24595번 - Rise and Fall 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 1024 MB34211010036.900%

문제

A number is said to Rise and Fall if the decimal representation can be broken up into two parts (possibly empty) where the first part has digits in nondecreasing order and the second part has digits in nonincreasing order.

Compute the largest number less than or equal to an input number that rises and falls.

입력

The first line of input contains an integer $t$ (1ドル \le t \le 10^5$), which is the number of test cases.

Each of the next $t$ lines contains a single integer $n$ (1ドル \le n < 10^{100{,}000}$). Each is a single test case.

  • Note: that is not a typo. The integer can be up to 10ドル^5$ digits long.

The sum of the lengths of all input test cases will not exceed 10ドル^5$.

출력

For each test case, output a single line with a single integer, which is the largest number less than or equal to the $n$ for that test case that rises and falls.

제한

예제 입력 1

2
29041
56577

예제 출력 1

29000
56555

힌트

출처

ICPC > Regionals > North America > Pacific Northwest Regional > 2021 ICPC Pacific Northwest Region > Division 1 F번

ICPC > Regionals > North America > Pacific Northwest Regional > 2021 ICPC Pacific Northwest Region > Division 2 S번

ICPC > Regionals > North America > South Central USA Regional > 2021 South Central USA Regional Contest > Division 2 G번

ICPC > Regionals > North America > Northeast North America Regional > 2021 Northeast North America Regional Contest E번

ICPC > Regionals > North America > Southeast USA Regional > 2021 Southeast USA Regional Programming Contest > Division 2 G번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /