Module: (C++) Nested loops


Problem

5 /8


Maximum sum of divisors

Problem

The number n is given. Find a number between 1 and n that has the maximum sum of its divisors (including non-prime divisors, 1, and the number itself). If there are several such numbers, print the minimum of them.

Input: The input to the program is natural n<=2500.
Output: Print the desired number.

Examples
# Input Output
1 5 4
2 12 12

time 2000 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!