华为oj求解立方根

#include<iostream>#include<iomanip>#define M  0.00001using namespace std;double getCubeRoot(double a)//牛顿迭代法 {double x0 = 1;while((x0*x0*x0-a)>M||(a-x0*x0*x0>M)){x0 = x0/2+a/(2*x0*x0);}return x0;}int main(){double a;cin>>a;cout<<setiosflags(ios::fixed)<<setprecision(1)<<getCubeRoot(a)<<endl;return 0;}