ZOJ Problem Set - 2818

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1818

一开始想着用循环做，看了别人的解法才发现根本没必要，比较根号n就行了

 #include<iostream>
 #include<cmath>
 #include<iomanip>
 using namespace std;

 int main()
 {
           double m,n;
           while(cin>>m>>n)
           {
                     if(m== || n == )
                               break;
                     int a = (int)powf(m,/n);
                     if(m-powf(a,n)<powf(a+,n)-m)
                               cout<<a<<endl;
                     else
                               cout<<a+<<endl;
           }
 }