【HDOJ5980】Find Small A（签到）

题意：不知道

思路：队友写的

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string.h>
#include <limits.h>
#include <string>
#include <iostream>
#include <queue>
#include <math.h>
#include <map>
using namespace std;
typedef long long int lint;

int n,ans;

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        ans = 0;
        for(int i = 1; i <= n; ++i){
            int num; scanf("%d",&num);
            while(num != 0){
                int now = 1;
                for(int i = 1; i <= 7; ++i){
                    now <<= 1; now += 1;
                }
                now = (num & now);
                num = num >> 8;
                if(now == 97){ ++ans;}
            }
        }
        printf("%d
",ans);
    }
    return 0;
}