M

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

题意：

在每行数中寻找二倍关系的数，看看有几对

分析：

可以用排列，然后用两个数做比较成立则加1，如果大的数比小的数小，则大数往后推直到大于或等于小数的2倍   然后再往后推小数 大数后面没有数了就停止

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,j=0,a[100],k,l,s;
    while(cin>>a[j]&&a[j]!=-1)
    {
        while(cin>>a[++j]&&a[j]!=0){}
        sort(a,a+j);
        for(s=0,l=0,k=1;k<j;l++)
        {
            if(a[k]==a[l]*2) s++;
            else
            if(a[k]<2*a[l])
            {
                while(a[k]<=a[l]*2)
                {
                    k++;
                    if(a[k]==a[l]*2)
                        s++;
                    if(k==j)break;
                }
            }
        }
    j=0;
    cout<<s<<endl;
    }
}

感受：

主要是在判断大数停止后推的时候有点麻烦 多用了点时间    其他都挺简单