forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
42 lines (31 loc) · 1.12 KB
/
B.cpp
File metadata and controls
42 lines (31 loc) · 1.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;
const int MN = 200111;
#define left left__
#define right right__
ll a[MN], left[MN], right[MN];
ll x, k;
int main() {
ios :: sync_with_stdio(false);
int n;
while (cin >> n >> k >> x) {
FOR(i,1,n) cin >> a[i];
ll px = 1;
FOR(i,1,k) px *= x;
FOR(i,1,n) left[i] = left[i-1] | a[i];
right[n+1] = 0;
FORD(i,n,1) right[i] = right[i+1] | a[i];
ll res = 0;
FOR(i,1,n) res = max(res, (a[i] * px) | left[i-1] | right[i+1]);
cout << res << endl;
}
}