zoj1760

简单题

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int num = 0;
    vector<int> blocks;
    while(1)
    {
        cin >> num;
        if(num == -1)
            break;
        if(num == 0)
        {
            for(int i = 0;i < blocks.size();i++)
            {
                if( find(blocks.begin(),blocks.end(),2*blocks[i]) != blocks.end() )
                    num ++;
            }
            cout << num << endl;
            blocks.clear();
            continue;
        }
        blocks.push_back(num);
    }
    return 0;
}