a671. 00113 - Power of Cryptography -- UVa113 | From: [118.165.122.203] | 發表日期 : 2013-07-17 15:52

#include<iostream>

#include<math.h>

using namespace std;

int main()

{

   float num=1,n,p;

   while(cin>>n>>p)

   {

 while(pow(num,n)!=p)

 num++;

 cout<<num<<endl;

 num=0;

   }

}

這樣寫會TLE?不知道為甚麼?這題應該只能這樣解吧?
 

a671. 00113 - Power of Cryptography -- UVa113 | From: [123.195.52.185] | 發表日期 : 2013-07-17 22:17

a671. 00113 - Power of Cryptography -- UVa113 | From: [118.165.122.203] | 發表日期 : 2013-07-19 13:59