UVa - 113 Power of Cryptography

解题感悟：

• 突然发现用double类型来处理这题好方便[]~(￣▽￣)~*

#include<stdio.h>#include<math.h>#include<string.h>char k[100];int main(void){    memset(k,0,sizeof(k));    double n,p;    while(scanf("%lf%lf",&n,&p)!=EOF){        sprintf(k,"%lf",pow(p,1/n)+0.5);            int i;        for(i=0;i<100;++i)            if(k[i]=='.'){                k[i]='\0';                break;            }        puts(k);    }    return 0;}