2013 ACM/ICPC Asia Regional Chengdu Online
2013-12-03 23:13
239 查看
C 4730
各种乱搞,拼手速了。
View Code
各种乱搞,拼手速了。
#include <iostream> #include <cstdio> #include <cstring> #define maxlen 100010 using namespace std; long long n,m; long long a[maxlen]; int main () { int t; scanf("%d",&t); for(int Case=1; Case<=t; ++Case) { scanf("%I64d%I64d",&n,&m); for(int i=0;i<n;++i) scanf("%I64d",&a[i]); long long ans=0; long long temp; for(int i=0;i<n;++i) { temp=a[i]; for(int j=i;j<n;++j) { temp|=a[j]; if(temp<m) ans++; else break; } } printf("Case #%d: %I64d\n",Case,ans); } }
View Code
相关文章推荐
- 2013 ACM/ICPC Asia Regional Chengdu Online
- HDU 4731 Minimum palindrome 找规律 (2013 ACM/ICPC Asia Regional Chengdu Online 1004)
- 2013 ACM/ICPC Asia Regional Chengdu Online
- 2013 ACM/ICPC Asia Regional Chengdu Online 个人总结
- 2013 ACM/ICPC Asia Regional Chengdu Online HDU 4731 Minimum palindrome(规律)
- hdu 4731 Minimum palindrome 找规律 (2013 ACM/ICPC Asia Regional Chengdu Online 1004)
- 2013 ACM/ICPC Asia Regional Chengdu Online---1003
- 2013 ACM/ICPC Asia Regional Chengdu Online 1004 Minimum palindrome
- 2013 ACM/ICPC Asia Regional Chengdu Online---1003
- hdu 4734 F(x)2013 ACM/ICPC Asia Regional Chengdu Online
- 2013 ACM/ICPC Asia Regional Chengdu Online
- hdu 4737 A Bit Fun || 2013 ACM/ICPC Asia Regional Chengdu Online || 简单题
- hdu 4734 F(x) 数位dp (2013 ACM/ICPC Asia Regional Chengdu Online 1007)
- 2013 ACM/ICPC Asia Regional Chengdu Online
- HDU 4735 Little Wish~ lyrical step~(DLX搜索)(2013 ACM/ICPC Asia Regional Chengdu Online)
- hdu 4737 A Bit Fun 数列(2013 ACM/ICPC Asia Regional Chengdu Online 1010)
- HDU4734——2013 ACM/ICPC Asia Regional Chengdu Online
- HDU 4729 An Easy Problem for Elfness(主席树)(2013 ACM/ICPC Asia Regional Chengdu Online)
- HDU 4737 A Bit Fun(2013 ACM/ICPC Asia Regional Chengdu Online)
- 2013 ACM/ICPC Asia Regional Chengdu Online_A Bit Fun