hdu 4737A Bit Fun

A Bit Fun

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

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
  
  

 

Source

2013 ACM/ICPC Asia Regional Chengdu Online 

水题：直接暴搜

#include <cstdio>
int a[100001];
int main(void) {
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif
    int t; scanf("%d", &t);
    long long int ans;
    for (int i = 1; i <= t; ++i) {
        ans = 0;
        printf("Case #%d: ", i);
        int m;
        int n, j, k;
        scanf("%d%d", &n, &m);
        for (j = 0; j < n; scanf("%d", a+j++));
        int tmp;
        for (j = 0; j < n; ++j) {
            tmp = a[j];
            for (k = j; k < n; ++k) {
                tmp = tmp | a[k];
                if (tmp < m)
                    ans++;
                else break;
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}