Preparing NOJ

xx

1000ms 65536K

Description:

使得x^x达到或超过n位数字的最小正整数x是多少?


Input:

输入一个正整数n  n<=2 000 000 000


Output:

输出使得x^x达到n位数字的最小正整数x


Sample Input:

11

Sample Output:

10

Note:

本题由旧版NOJ导入,来源:NUPT ACM 2010 Personal Ranking Contest

Info

NOJ

Provider NOJ

Code NOJ1439

Tags

Submitted 2

Passed 1

AC Rate 50%

Date 04/20/2019 10:03:10

Related

Nothing Yet