/*
Divide by Zero 2017 and Codeforces Round #399
Oath of the Night's Watch
时间: 2017/02/21
题意:在n个数中寻找比最大值小比最小值大的数有几个。
题解
*/
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
#define N 100010
#define INF 0x3f3f3f3f
int a[N];
int main()
{
int n;
while(~scanf("%d",&n))
{
int minn = INF, maxn = -INF;
for(int i = 0; i < n; i++)
{
scanf("%d",&a[i]);
minn = min(a[i],minn);
maxn = max(a[i],maxn);
}
int ans = n;
for(int i = 0; i < n; i++)
{
if(minn == a[i])
ans--;
else if(maxn == a[i])
ans--;
}
printf("%d\n",ans);
}
return 0;
}
/*
Divide by Zero 2017 and Codeforces Round #399
Code For 1
时间: 2017/02/21
题意:将一个数2^50,分半划分成0,1后,问在l,r区间1的数量
题解:
发现1,0出现的位置是和n的二进制有关,具体:满足i%(2^xi)==0的最大xi,第i个位置的数就是二进制从后往前的第xi个二进制值。
注意 位运算1<<n 在n较大时时间花费巨大
*/
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
#define LL long long
const int N = 110;
const int INF = 0x3f3f3f3f;
int a[N];
int main()
{
LL n,l,r;
while(cin>>n>>l>>r)
{
vector<int> bits;
while(n)
{
bits.push_back(n&1);
n /= 2;
}
reverse(bits.begin(),bits.end());
int sum = 0;
for(long long i = l; i <= r; i++)
{
int j = 0;
long long x = 1;
while(i%x == 0)
{
x <<= 1;
j++;
}
if(bits.size() <= j-1)
sum += 0;
else
sum += bits[j-1];
//printf("%d\n",sum);
}
printf("%d\n",sum);
}
return 0;
}
/*
Divide by Zero 2017 and Codeforces Round #399
Jon Snow and his Favourite Number
时间: 2017/02/21
题意:将n个数的集合处理k次,每次处理:先从小到大排序,然后奇数位于x异或,找到最后最大和最小的。
题解:参考了大神们的代码,了解到:既然要求从大到小,并且数和x的范围是1e3,异或后最大也就1024,那么开个数组a[i]代表当前值为i的数有几个。
从中做文章,从小到大处理出改变数的个数和当前处理后处在奇数位还是偶数位。
*/
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
#define N 1025
#define INF 0x3f3f3f3f
int a[N],b[N];
int main()
{
int n,k,x;
while(~scanf("%d%d%d",&n,&k,&x))
{
int f;
for(int i = 0; i < n; i++)
{
scanf("%d", &f);
a[f]++;
}
for(int i = 0; i < k; i++)
{
for(int j = 0; j < N; j++)
{
b[j] = a[j];
a[j] = 0;
}
int ge,odd = 0;
for(int j = 0; j < N; j++)
{
ge = (b[j]+1-odd)/2;// 要改变的个数
a[j^x] += ge;
a[j] += b[j]-ge;
odd = (b[j]+odd)%2;// 当前的处于位数的奇偶
}
}
int mx = 0, mn = 1024;
for(int i = 0; i < 1024; i++)
{
if(a[i])
{
mx = max(mx,i);
mn = min(mn,i);
}
}
printf("%d %d\n",mx,mn);
}
return 0;
}