A Bit Fun
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 839 Accepted Submission(s): 496
Problem Description
There are n numbers in a array, as a
0, a
1 ... , a
n-1, and another number m. We define a function f(i, j) = a
i|a
i+1|a
i+2| ... | a
j . Where "|" is the bit-OR operation. (i <= j)
The problem is really simple: please count the number of different pairs of (i, j) where f(i, j) < m.
The problem is really simple: please count the number of different pairs of (i, j) where f(i, j) < m.
Input
The first line has a number T (T <= 50) , indicating the number of test cases.
For each test case, first line contains two numbers n and m.(1 <= n <= 100000, 1 <= m <= 2 30) Then n numbers come in the second line which is the array a, where 1 <= a i <= 2 30.
For each test case, first line contains two numbers n and m.(1 <= n <= 100000, 1 <= m <= 2 30) Then n numbers come in the second line which is the array a, where 1 <= a i <= 2 30.
Output
For every case, you should output "Case #t: " at first, without quotes. The
t is the case number starting from 1.
Then follows the answer.
Then follows the answer.
Sample Input
2 3 6 1 3 5 2 4 5 4
Sample Output
Case #1: 4 Case #2: 0
Source
Recommend
这道题 就是暴力搜索 +一个简单的剪枝
#include<iostream>
using namespace std;
using namespace std;
int a[100010];
int t,n,m,count,ii;
int main()
{
ii=0;
cin>>t;
while(t--)
{
ii++;
count=0;
cin>>n>>m;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]<m) count++;
}
for(int i=0;i<n;i++)
{
int sum=a[i];
for(int j=i+1;j<n;j++)
{
sum=sum|a[j];
if(sum<m ) count++;
else break;
}
}
cout<<"Case #"<<ii<<": ";
cout<<count<<endl;
}
return 0;
}