求解立方根

最新推荐文章于 2021-10-07 00:07:36 发布

亮建

最新推荐文章于 2021-10-07 00:07:36 发布

阅读量309

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/u012067392/article/details/73323490

版权

IT 专栏收录该内容

260 篇文章 0 订阅

订阅专栏

#include<bits/stdc++.h>
using namespace std;
double Fab(double n)
{
    if(n<0)return -n;
    return n;
}
int main()
{
    double n;
    double start,end,mid;
    while(cin>>n)
    {
        if(n<0)
        {
            n=-n;
            cout<<"-";
        }
        else if(n>0)
        {
        }
        else
        {
            cout<<"0.0"<<endl;
            continue;
        }
        start=0,end=1000;
        mid=(start+end)/2;
        while(Fab(mid*mid*mid-n)>0.0001)
        {
            if(mid*mid*mid>n)
            {
                end=mid;
            }
            else
            {
                start=mid;
            }
            mid=(start+end)/2;
        }
        printf("%.1f\n",mid);
    }
    return 0;
}
/*
#include<bits/stdc++.h>
using namespace std;
double Fab(double n)
{
    if(n<0)return -n;
    return n;
}
int main()
{
    double n;
    double start,end,mid;
    while(cin>>n)
    {
        if(n>0)
        {
          if(n>1)
          {
              start=0,end=1000;
              mid=(start+end)/2;
              while(Fab(mid*mid*mid-n)>0.001)
              {
                  if(mid*mid*mid>n)
                  {
                   end=mid;
                  }
                  else {
                    start=mid;
                  }
                  mid=(start+end)/2;
              }
              printf("%.1f\n",mid);
          }
          else if(n<1)
          {
              start=0,end=1;
              mid=(start+end)/2;
              while(Fab(mid*mid*mid-n)>0.001)
              {
                  if(mid*mid*mid>n)
                  {
                   end=mid;
                  }
                  else {
                    start=mid;
                  }
                  mid=(start+end)/2;
              }
              printf("%.1f\n",mid);
          }
          else {
            cout<<"1.0"<<endl;
          }
        }
        else if(n<0)
        {
           n=-n;
           if(n>1)
          {
              start=0,end=1000;
              mid=(start+end)/2;
              while(Fab(mid*mid*mid-n)>0.001)
              {
                  if(mid*mid*mid>n)
                  {
                   end=mid;
                  }
                  else {
                    start=mid;
                  }
                  mid=(start+end)/2;
              }
              printf("-%.1f\n",mid);
          }
          else if(n<1)
          {
              start=0,end=1;
              mid=(start+end)/2;
              while(Fab(mid*mid*mid-n)>0.001)
              {
                  if(mid*mid*mid>n)
                  {
                   end=mid;
                  }
                  else {
                    start=mid;
                  }
                  mid=(start+end)/2;
              }
              printf("-%.1f\n",mid);
          }
          else {
            cout<<"-1.0"<<endl;
          }
        }
        else
        {
            cout<<"0.0"<<endl;
        }
    }
    return 0;
}
*/