基础算法（2）二分，高精度

Acwing 789.数的范围

 输出样例：

3 4
5 5
-1 -1

#include<iostream>
using namespace std;

const int N=1e6+10;
int n,q;
int a[N];

int main() {
    cin >> n >> q;
    for (int i = 0; i < n; i++) cin >> a[i];
    while(q--)
    {
        int l = 0, r = n - 1;
        int target;
        cin >> target;
        //查找左边界
        while (l < r) {
            int mid = l + (r - l) / 2;

            if (a[mid] >= target) r = mid ;
            else  l = mid + 1;
        }
        if (a[l] != target) cout << "0";
        else cout << l << " ";
        //查找右边界
       
        while (l < r) {
            int mid = l + (r - l) / 2;

            if (a[mid] <= target) l = mid ;
            else r = mid - 1;
        }
        cout << r << endl;
    }

    return 0;
}

求某个数的算术平方根

#include <iostream>
 using namespace std;

int main()
{
    double x;//求x的算术平方根
    cin >> x;
    double l=0,r=x;

    while ( r - l > 1e-8)
    {
        double mid = (l+r)/2;
        if (mid*mid >= x) r = mid;
        else l=mid;
    }
    printf ("%lf",l);
    return 0;
}

Acwing 790.数的三次方根

#include <iostream>
using namespace std;

int main()
{
    double x;
    cin >> x;
    double l = -10000,r = 10000;
    while(r-l > 1e-8)
    {
        double mid = (l+r)/2;
        if (mid*mid*mid >= x) r =mid;
        else l = mid;
    }
    printf("%lf",l);
    return 0;
}

Acwing791.高精度加法

#include <iostream>

#include <vector>

 using namespace std;
const int N=1e6+10;
vector<int>  add(vector<int> &A,vector<int> &B)
{
    vector<int> c;
    int t = 0;
    for (int i = 0;i < A.size()||i < B.size();i ++)
    {
        if (i < A.size()) t +=A[i];
        if (i < B.size()) t +=B[i];
        c.push_back(t%10);
        t/=10;
    }
    if (t) c.push_back(1);
    return c;
}
int main()
{
    string a,b;
    vector<int> A,B;

    cin >> a >> b ;
    for (int i = a.size()-1;i >= 0;i--) A.push_back(a[i]-'0');
    for (int i = b.size()-1;i >= 0;i--) B.push_back(b[i]-'0');
    vector<int> C = add(A,B);
    for (int i = C.size()-1;i >= 0;i--)
        printf("%d",C[i]);
    return 0;
}

Acwing 792.高精度减法

#include <iostream>
#include <vector>
using namespace std;

bool cmp(vector<int> &A,vector<int> &B)
{
    if (A.size() != B.size()) return A.size() > B.size();
    for (int i = A.size()-1;i >=0;i--)
    {
        if (A[i] != B[i]) return A[i] > B[i];
    }
    return true;
}
vector<int> sub(vector<int> &A,vector<int> &B)
{
    vector<int> C;
    int t = 0;
    for (int i =0; i <= A.size();i++)
    {
        t = A[i] - t;
        if (B.size() > i)  t = t - B[i];
        C.push_back((t+10)%10);
        if (t < 0) t =1;
        else t = 0;
    }
    while (C.size()>1 && C.back() == 0) C.pop_back();
    return C;
}

int main()
{
    vector<int> A,B;
    string a,b;
    cin >> a >> b;

    for (int i = a.size()-1;i >= 0;i--)
        A.push_back(a[i]-'0');
    for (int i = b.size()-1;i >= 0;i--)
        B.push_back(b[i]-'0');
    if(cmp(A,B))
    {
        auto C = sub(A,B);
        for (int i = C.size()-1;i >= 0;i--)
            cout << C[i];
    }
    else
    {
        cout << "-";
        auto C = sub (B,A);
        for (int i = C.size()-1;i >= 0;i--)
            cout << C[i];
    }
    return 0;

}

Acwing 793.高精度乘法

#include <iostream>
#include <vector>

using namespace std;
vector<int> mul(vector<int> &A,int b)
{
    vector<int> C;
    int t=0;
    for(int i = 0;i < A.size()|| t;i++)
    {
        if (i < A.size()) t += A[i]*b;
        C.push_back(t%10);
        t/=10;
    }
    return C;
}

int main()
{
    string a;
    int b;
    cin >> a >> b ;
    vector<int> A;
    for (int i = a.size()-1; i >= 0;i--) A.push_back(a[i]-'0');
    auto C = mul(A,b);
    for (int i = C.size()-1; i >= 0;i--)
        cout << C[i];
    return 0;

}

Acwing 794.高精度除法

//高精度除法
#include <iostream>
#include <vector>
#include <algorithm>//reverse头文件


using namespace std;
//A/b=C...r
vector<int> div(vector<int> &A,int b,int &r)//r 是引用
{
    vector<int> C;
    r=0;
    for(int i = A.size()-1;i >= 0;i--)
    {
        r = r * 10 + A[i];
        C.push_back(r/b);
        r%=b;

    }
    reverse(C.begin(),C.end());
    while(C.size() > 1 && C.back() == 0) C.pop_back();
    return C;
}

int main()
{
    string a;
    int b;
    cin >> a >> b ;
    vector<int> A;
    for (int i = a.size()-1; i >= 0;i--) A.push_back(a[i]-'0');
    int r;
    auto C = div(A,b,r);
    for (int i = C.size()-1; i >= 0;i--)
        cout << C[i] ;
    cout << endl << r << endl;
    return 0;

}