ACM程序设计题目 Problem M-13

//输入一行数据，遇到0结束输入，查找这些数中有多少个两倍关系。

//存到数组里，双重循环查找。做完一次后清空数组。

#include<iostream>#include<vector>using namespace std; vector<int>s;int main(){    int i,n,x,j,k,c;    for(i=0;;i++)    {        cin>>x;        if(x==-1)break;        if(x!=0)            s.push_back(x);        else {c=0;            n=s.size();            for(j=0;j<n-1;j++)                for(k=j+1;k<n;k++)                    {                        if(s[k]==2*s[j])                            c++;if(s[j]==2*s[k])    c++;                        }            cout<<c<<endl;s.clear();            }    }    return 0;}

动态数组的清空忘记了，刚开始谢了个循环，用了pop-back（）逐个清空。

Description

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