【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 = ;
         for(int i = ; i <= n; ++i){
             int num; scanf("%d",&num);
             while(num != ){
                 int now = ;
                 for(int i = ; i <= ; ++i){
                     now <<= ; now += ;
                 }
                 now = (num & now);
                 num = num >> ;
                 if(now == ){ ++ans;}
             }
         }
         printf("%d\n",ans);
     }
     return ;
 }