Doubles
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 19954 | Accepted: 11536 |
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
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 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.
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 <cstdio>
#include <string.h>
#include <cmath>
#include <iostream>
#include <algorithm>
#define WW freopen("output.txt","w",stdout)
using namespace std;
const int Max=110;
int Arr[Max];
bool vis[110];
int main()
{
int data;
int top;
while(scanf("%d",&Arr[0])&&Arr[0]!=-1)
{
memset(vis,false,sizeof(vis));
vis[Arr[0]]=true;
top=1;
while(1)
{
scanf("%d",&data);
if(!data)
break;
Arr[top++]=data;
vis[data]=true;
}
sort(Arr,Arr+top);
int sum=0;
for(int i=0;i<top;i++)
{
if(Arr[i]>50)
{
break;
}
if(vis[Arr[i]*2])
{
sum++;
}
}
printf("%d\n",sum); }
return 0;
}
版权声明：本文为博主原创文章，未经博主允许不得转载。