Module: (C++) Data processing in a loop. Anchoring


Problem

8 /9


*Two biggest digits

Problem

Given a natural number N (\(N<=10^9\)). Determine the two largest digits of a number. 

Input 
The input is a single number (the number contains at least 2 different digits).

Imprint 
Print two space-separated digits, first the largest digit of the number, then the second largest (not equal to the first largest digit).
 

 

Examples
# Input Output
1 45545 5 4
2 1113 3 1

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!