B. 练59.1 第n大的数

    Type: Default 1000ms 64MiB

练59.1 第n大的数

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Define a function to find the nn-th number in the sequence {9999, 200200, 9595, 8787, 9898, 12-12, 3030, 8787, 7575, 25-25}, and use it to output the nn-th largest number.

Input Format

A single line containing an integer nn. If nn is invalid, re-enter the input.

Output Format

A single line containing an integer, representing the nn-th largest number in the sequence.

Sample

2
99
-1
2
99

20251025C班作业(4)

Not Claimed
Status
Done
Problem
3
Open Since
2025-10-26 0:00
Deadline
2025-11-4 23:59
Extension
24 hour(s)