http://codeforces.com/contest/579/problem/D
题意
给你n个数,你可以操作k次,使得其中的某一个数乘以x
要求最后得到的所有数的或值最大
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 200005;
long long n, k, x;
long long a[N], sum[N], sum1[N];
long long ans, pow;
int main() {
cin >> n >> k >> x;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
pow = 1;
for (int i = 0; i < k; ++i) {
pow *&#