-
Cùng tham gia nhóm của FuOverflow trên Facebook https://www.facebook.com/groups/nvh2fuoverflow
PRF192_-_SP_2025_-_Block_5_-_PE_3823.webp
Bài viết gốc: Chủ đề 'PRF192 - SP 2025 - Block 5 - PE'
Kizspy.me
Constraint
N (100 ≤ N ≤999)
Output
Please print out its maximum number that is based on 3 digits of N.
Sample
Input
Sample 1
123
Sample 2
290
Problem 2
Output
321
920
[4 Points]
In a slow cycling competition, the champion is the person who takes the longest time to reach the
finish line. The competition has exactly three winners:
1. Champion (1st place)
2. Runner-up (2nd place)
3. Third place (3rd,
place)
Please indicate the time taken by the Runner-up (2nd place) to complete the race.
For example, if there are 10 contestants with finishing times of 2, 5, 7, 1, 3, 6, 9, 4, 6, 9, the
champion is the contestant who takes 9 seconds to finish. The runner-up is the second contestant
who also takes 9 seconds to complete the race.
Input
• The first line contains the number of competitors N.
The second line contains N integers are the time of N competitors, each number separated by
Zoom
+ 100%
Close
Constraint
N (100 ≤ N ≤999)Output
Please print out its maximum number that is based on 3 digits of N.
Sample
Input
Sample 1
123
Sample 2
290
Problem 2
Output
321
920
[4 Points]
In a slow cycling competition, the champion is the person who takes the longest time to reach the
finish line. The competition has exactly three winners:
1. Champion (1st place)
2. Runner-up (2nd place)
3. Third place (3rd,
place)
Please indicate the time taken by the Runner-up (2nd place) to complete the race.
For example, if there are 10 contestants with finishing times of 2, 5, 7, 1, 3, 6, 9, 4, 6, 9, the
champion is the contestant who takes 9 seconds to finish. The runner-up is the second contestant
who also takes 9 seconds to complete the race.
Input
• The first line contains the number of competitors N.
The second line contains N integers are the time of N competitors, each number separated by
Zoom
+ 100%
Close