UVa：113 - Power of Cryptography

作为初学者，看到二分查找如此用法，实为惊叹！

#include<stdio.h>#include<math.h>int main(){    double n,p;    while(scanf("%lf%lf",&n,&p)!=EOF){        int high=1000000000;        int low=1;        int mid;        while(low<=high){            mid=(high+low)/2;            double t=pow(mid,n);            if(t==p){                printf("%d\n",mid);                break;            }            if(t<p)                low=mid+1;            if(t>p)                high=mid-1;        }    }    return 0;}

--------------------------------------------------------------------------------------------

          Keep It Simple,Stupid!

--------------------------------------------------------------------------------------------