学步园

此题真心没发现跟贪心有一点关系.........刚开始就想到了了取巧的办法，真心懒.........

code

#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d\n",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("input.txt","r",stdin)
#define writef freopen("output.txt","w",stdout)
const int maxn = 1006;
const int INF = ~0U>>1;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
const double pi = acos(-1.0);
using namespace std;
int main()
{
    double n,p;
    while(~scanf("%lf%lf",&n,&p)){
        printf("%.f\n",pow(p,1.0/n));
    }
    return 0;
}

之后就想试一下二分怎么样，结果无限WA，求解!!!!!!! 

一下是错误的code

import java.math.BigInteger;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        while(cin.hasNext()){
        	int a=cin.nextInt();
        	BigInteger b=new BigInteger(cin.next());
        	if(a==1){
        		System.out.println(b);
        		continue;
        	}
        	int l=1,r=Math.min(1000000000,b.intValue());
        	while(l<=r){
        		BigInteger mid=new BigInteger((l+r)/2+"");
        		if(mid.pow(a).compareTo(b)==0){
        			System.out.println(mid);
        			break;
        		}
        		else if(mid.pow(a).compareTo(b)<0)
        			l=mid.intValue()+1;
        		else{
        			r=mid.intValue();
        		}  
        	}
        }
        
    }    
}