算法总结——二分法

#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
    long long  begin,end,mid,k;
    long long  n,m;
    begin = 1;end = 100000000;
    scanf("%d%d",&n,&m);//要使得什么的n次方为m
    while(begin <= end){
       mid = (begin + end) >> 1;
       k = pow(mid , n);
       if(k < m)
        begin = mid;
       else if(k > m)
        end = mid;
       else {
            printf("%lld",mid);
            break;
       }
    }
    return 0;
}