2013 ACM/ICPC Asia Regional Chengdu Online A Bit Fun

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<stdlib.h>
 4 
 5 int main()
 6 {
 7     int T,k=0;
 8     scanf("%d",&T);
 9     while(T--)
10     {
11       int m,n,i,j,a[110000],s,cnt=0;
12       scanf("%d%d",&m,&n);
13       for(i = 0;i < m; i++)
14       scanf("%d",&a[i]);
15       for(i = 0;i < m; i++)
16       {
17             s = a[i];
18             for(j = i;j < m; j++)
19                 {
20                     s |= a[j];
21                     if(s < n) cnt++;
22                     else break;
23                 }
24         }    
25         printf("Case #%d: %d\n",++k,cnt);
26       
27       
28     }
29     //system("pause");
30     return 0;
31 }

A Bit Fun

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

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

转载于:https://www.cnblogs.com/hpuzyf/p/3321212.html