eolymp
bolt
Try our new interface for solving problems
Problems

Terrible number

Terrible number

Ira began studying in the school square, cube and other roots of the integers. Roots Irinka given with difficulty, so the older sister Vera's younger sister decided to show different examples. And that itself does not spend time on the calculation of the roots, Vere need a program that will calculate the required number. This program should work very simply: given positive integers \textbf{B} and \textbf{N}. Necessary to find an integer \textbf{A}, that the \textbf{A^N} is the closest number to \textbf{B}. Note that \textbf{A^N} may be less, equal to or greater than \textbf{B}. \textbf{Input } In the input file contains two integers \textbf{B} and \textbf{N}. \textbf{1} ≤ \textbf{B} ≤ \textbf{1000000}. \textbf{1} ≤ \textbf{N} ≤ \textbf{9}. \textbf{Output} Display single number - the answer to the challenge. \href{http://translate.google.com.ua/translate_s?hl=ru&sl=ru&tl=en&q=%D0%A1%D1%82%D1%80%D0%B0%D1%88%D0%BD%D0%BE%D0%B5%20%D1%87%D0%B8%D1%81%D0%BB%D0%BE&source=translation_link}{поиск}
Time limit 1 second
Memory limit 64 MiB
Input example #1
4 3
Output example #1
1
Source Отборочный тур Всероссийской командной олимпиады школьников 2009/2010 учебный год