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
题目大意就是输入一组数判断有几对两倍关系,两倍关系是指一个数是另一个数的两倍;
思路如下:
先输入一组数进行排序,从小的数开始找后面有没有两倍关系的数;
程序如下:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int s[20],i,j,k,a,sum=0;
for(i=0;cin>>a;i++)
{
if(a==-1)
{
break;
}
else if(a==0)
{
sort(s,s+i);
for(j=0;j<i;j++)
{
for(k=j+1;k<i;k++)
{
if((s[j]*2)==s[k])
{
sum++; //两倍关系记一个
break;
}
}
}
cout<<sum<<endl;
sum=0;
i=-1;
}
else
s[i]=a;
}
}
我以为这样暴力破解会超时,但是没什么问题。