| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
shui#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
int main() {
int B, N;
while(1){
scanf("%d%d",&B,&N);
if(!B)break;
int t = (int)pow(B+0.0,1.0/N);
if(pow(t+0.0,N+0.0)+pow(t+1.0,N+0.0)>2*B) printf("%d\n",t);
else printf("%d\n",t+1);
}
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator