HDU1303+水

水题不解释。。。

/*
简单题
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<map>
#include<math.h>
typedef long long ll;
//typedef __int64 int64;
const int maxn = 205;
const int maxm = 1005;
const int inf = 0x7FFFFFFF;
const double pi = acos(-1.0);
const double eps = 1e-8;
using namespace std;

int vis[ maxn ];
int a[ maxn ];

int main(){
    int n;
    while( scanf("%d",&n)==1 ){
        if( n==-1 ) break;
        int cnt = 0;
        a[ cnt++ ] = n;
        memset( vis,0,sizeof( vis ) );
        vis[ n ] = 1;
        while( scanf("%d",&n)==1 ){
            if( n==0 ) break;
            a[ cnt++ ] = n;
            vis[ n ] = 1;
        }
        int res = 0;
        sort( a,a+cnt );
        for( int i=cnt-1;i>=0;i-- ){
            if( a[i]%2==0 ){
                if( vis[ a[i]/2 ]==1 ) res++;
            }
        }
        printf("%d\n",res);
    }
    return 0;
}