HDU 5980 Find Small A 【二进制数】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5980

题意：一个字符8位二进制数，问一组数有几个 二进制的 97；

思路： a%256（二进制 1 << 8）能够取a的二进制的后8位的数字，a/= 256 是去掉后8位的二进制；

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#include<map>
#include<stack>
#include<sstream>
#include<vector>
#include<string>
#include<set>

using namespace std;
using namespace __gnu_pbds;

#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define REP(i,n) for(int i=0;i<n;++i)

int read(){

    int r=0,f=1;char p=getchar();
    while(p>'9'||p<'0'){if(p=='-')f=-1;p=getchar();}
    while(p>='0'&&p<='9'){r=r*10+p-48;p=getchar();}return r*f;
}

typedef tree<pair<long long,int>,null_type,less< pair<long long,int> >,rb_tree_tag,tree_order_statistics_node_update> rbtree;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
const int Maxn = 5e4+10;
const long long LINF = 1e18;
const int INF = 0x3f3f3f3f;
const int Mod = 10001;
const double PI = acos(-1.0);

int main (void)
{
    int n;
    while (cin >> n) {
        int ans = 0, tmp;
        for (int i = 0; i < n; ++i) {
            cin >> tmp;
            while (tmp) {
                if(tmp%256 == 97) ans++;
                tmp/=256;
            }
        }
        cout << ans << endl;
    }
    return 0;
}