HDU - 4737 A Bit Fun 暴力水题

题目大意：给出n个数，要求找出符合 f(i, j) = a i|a i+1|a i+2| … | a j . Where “|” is the bit-OR operation. (i <= j) 的区间有多少个

解题思路：直接暴力

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;#define maxn 100010
long long num[maxn];int main() {int test, mark = 1, n;long long m;scanf("%d", &test);while(test--) {scanf("%d%lld",&n, &m);long long ans = 0;for(int i = 0; i < n; i++) {scanf("%lld", &num[i]);if(num[i] < m)ans++;  }long long tmp;for(int i = 0; i < n; i++) {tmp = num[i];for(int j = i + 1; j < n; j++) {tmp |= num[j];if(tmp >= m)break;ans++;  }}printf("Case #%d: %lld\n", mark++, ans);}return 0;
}

HDU - 4737 A Bit Fun 暴力水题相关推荐

hznu 1437: Clockwise（隐藏的暴力水题，数学）
Saya have a long necklace with N beads, and she signs the beads from 1 to N. Then she fixes them to ...
HDU 1248 寒冰王座(全然背包:入门题)
HDU 1248 寒冰王座(全然背包:入门题) http://acm.hdu.edu.cn/showproblem.php?pid=1248 题意: 不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票 ...
HDU 1576 A/B（数论简单题，求逆元）
A/B Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submis ...
Valentine's Day Round hdu 5176 The Experience of Love [好题带权并查集 unsigned long long]
传送门 The Experience of Love Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Ja ...
HDU 2546 饭卡(01背包裸题)
饭卡 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submiss ...
hdu 2275 Kiki Little Kiki 1 水题
题目:http://acm.hdu.edu.cn/showproblem.php?pid=2275 这个题比较简单,所以就没有测试样例提供给大家,基本把题目的样例过了就可以了题目大意给你一串操作, ...
hdu 1251 统计难题 (字典树入门题）
1 /******************************************************* 2 题目: 统计难题 (hdu 1251) 3 链接: http://acm.hd ...
HDU 5427 A problem of sorting 水题
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5427 A problem of sorting Time Limit: 2000/1000 MS ( ...
HDU 5476 Explore Track of Point 几何题 —— 2015 ACM/ICPC Asia Regional Shanghai Online
题目见HDU 5476 给出等腰三角形ABC,AB=AC,M为BC中点.P点为三角形内使min{∠MPB+∠APC,∠MPC+∠APB} 最大的点.求P点轨迹. 则容易找到中线AM上的P点都满足使得∠ ...

HDU - 4737 A Bit Fun 暴力水题

HDU - 4737 A Bit Fun 暴力水题相关推荐

最新文章

热门文章