hdu 1303 Doubles

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=1303
刷些水题打发时间。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
using std::cin;
using std::cout;
using std::endl;
using std::find;
using std::sort;
using std::set;
using std::map;
using std::pair;
using std::vector;
using std::multiset;
using std::multimap;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define iter(c) decltype((c).begin())
#define cls(arr,val) memset(arr,val,sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
const int Max_N = 100010;
typedef unsigned long long ull;
set<int> res;
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int v;
    while (~scanf("%d", &v) && ~v) {
        int sum = 0;
        res.insert(v);
        while (~scanf("%d", &v) && v) res.insert(v);
        tr(res, ite) {
            if (res.find(*ite << 1) != res.end()) sum++;
        }
        printf("%d\n", sum);
        res.clear();
    }
    return 0;
}