#include <bits/stdc++.h>
#define maxn 1000005
#define MOD 1000000007
using namespace std;
typedef long long ll;
int d[2][2505];
int main(){
// freopen("in.txt", "r", stdin);
int n, k, x, a;
scanf("%d%d%d", &n, &k, &x);
for(int i = 0; i < n; i++){
scanf("%d", &a);
d[0][a]++;
}
int e = 0;
while(k--){
int cnt = 0;
for(int i = 0; i <= 2500; i++){
int s = 0;
if(d[e][i]){
if(cnt % 2 == 0){
s += d[e][i] / 2;
if(d[e][i]&1)
s++;
d[e^1][i^x] += s;
}
else{
s += d[e][i] / 2;
d[e^1][i^x] += s;
}
d[e^1][i] += d[e][i] - s;
cnt += d[e][i];
d[e][i] = 0;
}
}
e ^= 1;
}
for(int i = 2500; i >= 0; i--){
if(d[e][i]){
printf("%d", i);
break;
}
}
for(int i = 0; i <= 2500; i++){
if(d[e][i]){
printf(" %d", i);
break;
}
}
puts("");
return 0;
}
Codeforces768C-Jon Snow and his Favourite Number
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.