1160.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1160 on 2005-10-02 at 11:24:40 */ 
#include <stdio.h>
#include <math.h>

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