[Original post:
http://acm.tongji.edu.cn/people/ps/showproblem.php?problem_id=1003&contest_id=6]
Problem
In order to save Athena, Axus, Zilong, Ice, and Axi, you must have a golden tweet palace.
This topic contains multiple sets of data.
For each group of data outputs,
10
Sample Output
6
The fourth they came to the Cancer, and Divas, who had a Cancer Golden Saint Seiyou, was mad, there were many bodies in the Cancer Palace. They are all people who kill. Now Zilong will leave in order to let Starthya first, so a person stays and Divas. (The Ice and Angi is still in the Double Treasure ...) However, he wants to know how many people in Divas kill in his life.
Known Dimas kills n individual, 1 <= n <= k <= 2 * 109, N this number is particularly special, and is a number that is mostly more than K, the number, the smallest number. For example, K = 10, with a maximum of 6, 8, 10. There are 4 covenants, but N is minimized 6. Zilong revenge for those who innocent deaths, decided to hit Divas N!
In the end, Zilong made a joining Mount Mountain, killing Di Mas. His eyes are also in the middle of the world and is cured by Athena.
INPUT
Chapter 1, K (1 <= k <= 2 * 109)
OUTPUT
For integer n, it means that more people in Divas kill in life.
Sample Input
------------------------------------
Long Int Num, I = 0, J, Cout, Cout1, Min;
Std :: CIN >> NUM;
Cout = cout1 = 0; // More than the number
Min = NUM; // The minimum number of the symbol conditions
For (i = NUM; I> 0; I -)
{
Cout1 = 0;
For (j = 1; j <= i; j ) // statistics i approximately number
{
IF (i% j == 0)
Cout1 ;
}
IF (cout1> = coup)
{
Cout = cout1;
Min = i;
}
}
