zoj 1760 Doubles（set集合容器的应用）

题目链接：

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1760

题目描述：

As part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each list are twice some other item in the same list. You will need a program to help you with the grading. This program should be able to scan the lists and output the correct answer for each one. For example, given the list

1 4 3 2 9 7 18 22

your program should answer 3, as 2 is twice 1, 4 is twice 2, and 18 is twice 9.

Input

The input file will consist of one or more lists of numbers. There will be one list of numbers per line. Each list will contain from 2 to 15 unique positive integers. No integer will be larger than 99. Each line will be terminated with the integer 0, which is not considered part of the list. A line with the single number -1 will mark the end of the file. The example input below shows 3 separate lists. Some lists may not contain any doubles.

Output

The output will consist of one line per input list, containing a count of the items that are double some other item.

Sample Input

1 4 3 2 9 7 18 22 0
2 4 8 10 0
7 5 11 13 1 3 0
-1

Sample Output

3
2
0

/*问题 求一串数字中存在谁是谁的两倍的关系的个数
解题思路 问题很简单，主要是使用了STL中的set集合，查询起来速度是极快的。*/ 
#include <set>
#include <cstdio>
using namespace std;

int main()
{
    int n,sum;
    set<int> s;
    set<int>::iterator it;
    while(1)
    {
        scanf("%d",&n);
        if(n == -1) break;
        if(n == 0)
        {
            sum=0;
            for(it=s.begin(); it != s.end();it++){
                if(s.find(2*(*it)) != s.end())
                    sum++;
            }
            printf("%d
",sum);
            s.clear();
        }
        else
            s.insert(n);
    }
    return 0;
}