【HDOJ】4737 A Bit Fun

水题。不过题目很有趣儿。

 #include <cstdio>

 #define MAXN 100005

 int a[MAXN];

 int main() {
     int t, n, m;
     int i, j, k, tmp, ans;

     scanf("%d", &t);
     for (k=; k<=t; ++k) {
         scanf("%d %d", &n, &m);
         for (i=; i<n; ++i)
             scanf("%d", &a[i]);
         ans = ;
         for (i=; i<n; ++i) {
             tmp = ;
             for (j=i; j<n; ++j) {
                 tmp |= a[j];
                 if (tmp < m)
                     ++ans;
                 else
                     break;
             }
         }
         printf("Case #%d: %d\n", k, ans);
     }

     return ;
 }