2109.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#include"stdio.h"
#include"math.h"
int main()
{
double n,m;

while(scanf("%lf%lf",&n,&m)==2) printf("%.0lf\n",pow(m,1/n));
return 0;
}

Problem Id:2109  User Id:fzk 
Memory:56K  Time:0MS
Language:GCC  Result:Accepted

Source 

main(){double n,m;while(scanf("%lf%lf",&n,&m)>1)printf("%.0f\n",pow(m,1/n));}