题目大意:给出n个数,要求找出符合 f(i, j) = a i|a i+1|a i+2| … | a j . Where “|” is the bit-OR operation. (i <= j) 的区间有多少个
解题思路:直接暴力
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define maxn 100010
long long num[maxn];
int main() {
int test, mark = 1, n;
long long m;
scanf("%d", &test);
while(test--) {
scanf("%d%lld",&n, &m);
long long ans = 0;
for(int i = 0; i < n; i++) {
scanf("%lld", &num[i]);
if(num[i] < m)
ans++;
}
long long tmp;
for(int i = 0; i < n; i++) {
tmp = num[i];
for(int j = i + 1; j < n; j++) {
tmp |= num[j];
if(tmp >= m)
break;
ans++;
}
}
printf("Case #%d: %lld\n", mark++, ans);
}
return 0;
}