rt

输入是样例

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug() puts("I WILL AK")
#define N 24
#define M 9982443353
int dp[1<<N];
int a[N],b[N];
int n,m;
int sum[N];
signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	for(int i=0;i<n;++i){
		cin>>a[i];
		sum[1<<i]=a[i];
	}
	cin>>m;
	for(int i=0;i<m;++i){
		cin>>b[i];
	}
	dp[0]=1;
	for(int i=1;i<(1<<n);++i){
		int d=i&-i;
		sum[i]=sum[i^d]+sum[d];
		if(sum[i]==b[0]||sum[i]==b[1]) continue;
		//puts("");
		for(int j=i,k;j>0;j^=k){
			k=j&-j;
			dp[i]+=dp[i^k];
			if(dp[i]>=M) dp[i]-=M;
			//cout<<k<<'\n';
		}
	}
	//cout<<(1<<n)<<' ';
	cout<<dp[(1<<n)-1];
	return 0;
}

output: 126897

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug() puts("I WILL AK")
#define N 24
#define M 9982443353
int dp[1<<N];
int a[N],b[N];
int n,m;
int sum[N];
signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	for(int i=0;i<n;++i){
		cin>>a[i];
		sum[1<<i]=a[i];
	}
	cin>>m;
	for(int i=0;i<m;++i){
		cin>>b[i];
	}
	dp[0]=1;
	for(int i=1;i<(1<<n);++i){
		int d=i&-i;
		sum[i]=sum[i^d]+sum[d];
		if(sum[i]==b[0]||sum[i]==b[1]) continue;
		puts("");
		for(int j=i,k;j>0;j^=k){
			k=j&-j;
			dp[i]+=dp[i^k];
			if(dp[i]>=M) dp[i]-=M;
			cout<<k<<'\n';
		}
	}
	//cout<<(1<<n)<<' ';
	cout<<dp[(1<<n)-1];
	return 0;
}

output：

https://www.luogu.com.cn/paste/eilqzled

最后一行是86577

把N改为25，增加

	for(int i=1;i<(1<<n);++i){
		cout<<"i:"<<i<<' '<<dp[i]<<'\n';
	}

输出：https://www.luogu.com.cn/paste/jnnqymz3

在此基础上，改为

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug() puts("I WILL AK")
#define N 25
#define M 9982443353
int dp[1<<N];
int a[N],b[N];
int n,m;
int sum[N];
signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	for(int i=0;i<n;++i){
		cin>>a[i];
		sum[1<<i]=a[i];
	}
	cin>>m;
	for(int i=0;i<m;++i){
		cin>>b[i];
	}
	dp[0]=1;
	for(int i=1;i<(1<<n);++i){
		int d=i&-i;
		sum[i]=sum[i^d]+sum[d];
		if(sum[i]==b[0]||sum[i]==b[1]) continue;
		//puts("");
		for(int j=i,k;j>0;j^=k){
			k=j&-j;
			dp[i]+=dp[i^k];
			if(dp[i]>=M) dp[i]-=M;
			cout<<j<<'\n';
		}
	}
	for(int i=1;i<(1<<n);++i){
		cout<<"i:"<<i<<' '<<dp[i]<<'\n';
	}
	cout<<dp[(1<<n)-1];
	return 0;
}

https://www.luogu.com.cn/paste/wmfi36gt

最后一行42249851

大脑炸了

打了2年OI从没见过这种