HDU 4737 A Bit Fun

最新推荐文章于 2016-09-14 20:55:10 发布

乱夏

最新推荐文章于 2016-09-14 20:55:10 发布

阅读量457

点赞数

分类专栏： acm简单题文章标签： acm simple

本文链接：https://blog.csdn.net/luanxia77/article/details/11690787

版权

acm简单题专栏收录该内容

2 篇文章 0 订阅

订阅专栏

This problem is simple too.

The thinking is just enumeration。

But if you can not deal with the details，it is easy to be the TLE。

Problem：

A Bit Fun

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.

My code :

#include <stdio.h>
#include <stdlib.h>
const int size = 1000010;
int a[size];
int main()
{
	int t,n,m,s,e,count,f;
	scanf("%d",&t);
	for(int i = 0;i < t;i++)
	{
		count = 0;
		scanf("%d%d",&n,&m);
		for(int j=0;j<n;j++)
		   scanf("%d",&a[j]);
		for(s=0;s<n;++s)
		{
		   if(a[s]>m)continue;
		   else
		   {
		   f=a[s];
		   for(e=s;e<n;++e)
		   {
		   	f=f|a[e];
		   	if(f<m)count++;
		   	else break;
		   }
	       }
	    }
		printf("Case #%d: %d\n",i+1,count);
	}
}

ps: Forgive my poor English.......