8pts 求调

12345678910111213141516171819202122232425262728293031323334353637#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=100010;
const int mod=19260817;
signed main()
{
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);
	int a[6];
	for_each(a,a+6,[&](auto &input){std::cin>>input;});
	vector<int>f(2160,0),all_size;f[0]=1;
	for_each(a,a+6,[&](auto &each){
		vector<int>val_list;
		int tmp=each;
		if(!tmp)
			return;
		for(int bin=0;;++bin){
			int bin_1=1ll<<bin;
			if(bin_1>=tmp){
				val_list.emplace_back(tmp);
				break;
			}
			val_list.emplace_back(bin_1);
			tmp-=bin_1;
		}
		for_each(val_list.begin(),val_list.end(),[&](auto &each){
			all_size.emplace_back(each);
		});
	});
	for_each(all_size.begin(),all_size.end(),[&](auto &each){
		for(int i=2159;i>=each;--i)
			f[i]+=f[i-each];
	});
	cout<<"Total=";
	cout<<count_if(f.begin(),f.end(),[&](auto &each){return !!each;})<<'\n';
	return EXIT_SUCCESS;
}