/*
中文题目 两倍
中文翻译-大意 找出一组数中,一个数是另外一个数两倍的个数
解题思路:用for循环逐个寻找
难点详解:如何控制结束,在结束时是输入-1的,在第一个a[0]=-1就结束就可以了。每行都有结束的标志,用 i f 语句判断结束就可以了
关键点:如何控制结束
解题人:lingnichong
解题时间:2014-08-20 00:42:13
解题体会:水
*/
Doubles
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3425 Accepted Submission(s): 2404
Problem 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.
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
Source
#include<stdio.h>
#include<string.h>
int a[110]={0};
int main()
{
int i,j,count,k;
while(scanf("%d",&a[0])&&a[0]!=-1)
{
count=0;
for(i=1;;i++)
{
scanf("%d",&a[i]);
if(a[i]==0) break;
}
for(j=0;j<i;j++)
{
for(k=0;k<i;k++)
{
if(a[k]==2*a[j])
count++;
}
}
printf("%d\n",count);
memset(a,0,sizeof(a));
}
return 0;
}