补

B

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

const int N = 100010, M = 3100010;
bool vis[N];
int n, m;
int a[N], son[M][2], idx;
int main()
{
    cin >> n >> m;    
    int res=pow(2,m);
    int x=pow(2,m);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    sort(a,a+n);
    for(int i=0;i<n-1;i++)
    {
        if(res>(a[i]^a[i+1]))
            res=a[i]^a[i+1];
    }
    cout <<x-res-1<< endl;

    return 0;
}

C

#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int maxn=1e5+5;
const ll mod=998244353;
ll inv[maxn], fac[maxn];  //分别表示逆元和阶乘
//快速幂
ll quickPow(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1)
			ans=(ans*a)%mod;
		b>>=1;
		a=(a*a)%mod;
	}
	return ans;
}

void init(){
	//求阶乘
	fac[0]=1;
	for(int i=1;i<maxn;i++){
		fac[i]=fac[i-1]*i%mod;
	}
	//求逆元
	inv[maxn-1]=quickPow(fac[maxn-1],mod-2);
	for(int i=maxn-2;i>=0;i--){
		inv[i]=inv[i+1]*(i+1)%mod;
	}
}
ll C(int n,int m){
	if(m>n){
		return 0;
	}
	if(m==0)
		return 1;
	return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main(){
	init();
	int n,m;
	scanf("%d%d",&n,&m);
	int sum=0;
	for(int i=0;i<n;i++) {
		int a;
		cin>>a;
		sum+=a-1;
	}
	m-=sum;
	printf("%lld\n",(C(m-1,n)+C(m-1,n-1))%mod);
}

F

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int b[N];
bool cmp(char a,char b)
{
    return a>b;
}
int main()
{
    int x;
    int res=0;
    cin>>x;
    res=x;
    int begin=1;
    b[0]=x;
    char c;
    while(cin>>c>>x)
    {
        if(c=='+')
        {
            b[begin]=x;
            begin++;
            res+=x;
        }
        else break;
    }
    sort(b,b+begin);
    for(int i=begin-1;i>=0;i--)
    {
        cout<<b[i];
        if(i!=0)
        cout<<'+';
    }
    cout<<endl;
    cout<<res;
}

D

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int a,b;
        cin>>a>>b;
        int res=a+1-(b+1)/2;
        cout<<res<<endl;
    }
}

H

#include <algorithm>
using namespace std;
bool is_prime(int n){
    if(n < 2) return false;
    for(int i = 2;i <= n / i;i ++){
        if(n % i == 0){
            return false;
        }
    }
    return true;
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i = 1;i <= n;i ++){
        int x;
        scanf("%d",&x);
        if(is_prime(x)) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}