POJ2109

 

类型             长度 (bit)            有效数字                    绝对值范围float             32                      6~7                  10^(-37) ~ 10^38double          64                     15~16               10^(-307) ~10^308long double   128                   18~19                10^(-4931) ~ 10 ^ 4932

Problem: 2109 User: qq1203456195Memory: 280K Time: 0MSLanguage: C++ Result: Accepted #include <iostream> #include <math.h> using namespace std; int main() { double n,p; while (cin>>n>>p) cout<<pow(p,1.0/n)<<endl; return 1; }

转载于:https://www.cnblogs.com/CheeseZH/archive/2012/04/12/2444751.html

相关资源：数据结构—成绩单生成器