hdu4737 A Bit Fun (2013 网络赛 成都赛区)

A Bit Fun

Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 71    Accepted Submission(s): 37

Problem Description

There are n numbers in a array, as a ₀, a ₁ ... , 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.

 

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 ³⁰) Then n numbers come in the second line which is the array a, where 1 <= a _i <= 2 ³⁰.

 

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.

 

Sample Input

  
  

   
   2
3 6
1 3 5
2 4
5 4
  
  

 

Sample Output

  
  

   
   Case #1: 4
Case #2: 0
  
  

 

枚举 

#include <iostream>

using namespace std;

#define MAXN 100001

int temp[MAXN];

void input()
{
    int t;
    int n, m, k = 0;
    cin >> t;

    while (t--)
    {
        long long ans = 0;

        cin >> n >> m;

        for (int i = 0; i < n; i++)
        {
            cin >> temp[i];
        }

        for (int i = 0; i < n; i++)
        {
            int tmp = 1;

            for (int j = i; j < n; j++)
            {
                tmp |= temp[j];
                if (tmp < m)
                {
                    ans++;
                }
                else
                {
                    break;
                }
            }
        }
        cout << "Case #" << ++k << ": ";
        cout << ans << endl;
    }
}

int main()
{
    std::ios::sync_with_stdio(false);
    input();
    return 0;
}