位运算+数论

A Bit Fun

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

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

 

Recommend

liuyiding

或操作只会使结果变大不会变小。。。。。。

 

/*
 * Author:  *****
 * Created Time:  2013/9/14 19:54:39
 * File Name: A.cpp
 * solve: A.cpp
 */
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
#include<stack>
#include<set>
#include<iostream>
#include<vector>
#include<queue>
//ios_base::sync_with_stdio(false);
//#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;
#define sz(v) ((int)(v).size())
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define repf(i, a, b) for (int i = (a); i <= (b); ++i)
#define repd(i, a, b) for (int i = (a); i >= (b); --i)
#define clr(x) memset(x,0,sizeof(x))
#define clrs( x , y ) memset(x,y,sizeof(x))
#define out(x) printf(#x" %d\n", x)
#define sqr(x) ((x) * (x))
typedef long long LL;

const int INF = 1000000000;
const double eps = 1e-8;
const int maxn = 100010;

int sgn(const double &x) {  return (x > eps) - (x < -eps); }

int n,m;
int num[maxn];
int main() 
{
    //freopen("in.txt","r",stdin);
    int T;
    scanf("%d",&T);
    int kcase = 1;
    while(T--)
    {
        scanf("%d%d",&n,&m);
        rep(i,0,n)
            scanf("%d",&num[i]); 
        printf("Case #%d: ",kcase++);
        
        int ans = 0;
        rep(i,0,n)
        {
            int temp = num[i];
            rep(j,i,n)
            {
                temp |= num[j];
                if(temp<m)
                    ans++;
                else
                    break;
            }
        }
        cout<<ans<<endl;
    }

    return 0;
}