https://www.nowcoder.com/practice/30c1674ad5694b3f8f0bc2de6f005490?tpId=8&&tqId=11019&rp=1&ru=/activity/oj&qru=/ta/cracking-the-coding-interview/question-ranking

class BinInsert {
public:
    int binInsert(int n, int m, int j, int i) {
        // write code here
        m<<=j;
        return n|=m;
    }
};



https://www.nowcoder.com/practice/f8538f9ae3f1484fb137789dec6eedb9?tpId=37&&tqId=21283&rp=1&ru=/activity/oj&qru=/ta/huawei/question-ranking

#include <iostream>
#include <math.h>
using namespace std;

bool PriNum(int num)
{
    for(int i=2; i<=sqrt(num); i++)
    {
        if(num%i==0)
        {
            return false;
        }
    }

    return true;
}

int main()
{
    int n=0;
    cin>>n;
    int mid=0, min=0, max=0;
    
    mid=n/2;    //从中间向两边找
    for(int i=mid; i>1; i--)//一不是素数
    {
        if(PriNum(i) && PriNum(n-i))
        {
            min=i;
            max=n-i;
            break;
        }
    }

    cout<<min<<endl;
    cout<<max<<endl;
    return 0;
}