- 给定n个数s[0],s[1],s[2],s[3]…s[n-1],求一个数w,使得w ^s [0]+w ^ s[1]+w ^ s[2]…w ^ s[n-1]的和最小。
- 思路:将n个数化为二进制数,统计n个数在每位二进制上1的个数,w的二进制取n个数每位二进制上个数多的(1或0),然后转化为十进制数w。
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define mod 1000000007
#define INF 0x3f3f3f
#define fi first
#define se second
#define it iterator
#define ins insert
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define np next_permutation
#define pq priority_queue
#define ll long long
#define ull unsigned long long
#