hdoj 5980 Find Small A

题目链接：Find Small A

题目大意：有n个数，问里面有多少个字节的97，转化成二进制然后8个字节算一次就好了

题目思路：直接暴力算，比较每八个位和97的八位是不是相同就好了

#include <map>#include <set>#include <cmath>#include <vector>#include <cstdio>#include <cstring>#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;typedef long long ll;int main(){    int n,x,ans,bi[15];    while(~scanf("%d",&n)){        ans = 0;        for(int i = 0;i < n;i++){            scanf("%d",&x);            while(x != 0){                for(int j = 0;j < 8;j++){                    bi[j] = x%2;                    x /= 2;                }                if(bi[0] == 1&&bi[5] == 1&&bi[6] == 1&&bi[1]+bi[2]+bi[3]+bi[4]+bi[7] == 0)                    ans++;            }        }        printf("%d\n",ans);    }    return 0;}