1760_Doubles
2013-04-14 22:17
295 查看
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
Source: Mid-Central USA 2003
×××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××
//输入格式比较重要
#include<iostream>
using namespace std;
int main()
{
int num[15];
int n;
int i;
int count;
while(cin>>n&&n!=-1)
{
i=0;
count=0;
num[i++]=n;
while(cin>>n&&n)
{
num[i++]=n;
}
for(int j=0;j!=i;j++)
{
if(num[j]%2==0)
{
for(int k=0;k!=i;k++)
if(num[k]==num[j]/2)
++count;
}
}
cout<<count<<endl;
}
return 0;
}
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
Source: Mid-Central USA 2003
×××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××
//输入格式比较重要
#include<iostream>
using namespace std;
int main()
{
int num[15];
int n;
int i;
int count;
while(cin>>n&&n!=-1)
{
i=0;
count=0;
num[i++]=n;
while(cin>>n&&n)
{
num[i++]=n;
}
for(int j=0;j!=i;j++)
{
if(num[j]%2==0)
{
for(int k=0;k!=i;k++)
if(num[k]==num[j]/2)
++count;
}
}
cout<<count<<endl;
}
return 0;
}
相关文章推荐
- ZOJ 1760 Doubles
- zoj 1760 Doubles(set集合容器的应用)
- zoj 1760.Doubles
- zoj 1760 Doubles
- ZOJ Problem Set - 1760 Doubles
- zoj 1760 Doubles
- zoj 1760 Doubles
- zoj 1760 Doubles
- ZOJ Problem Set–1760 Doubles
- ZOJ 1760 &&POJ1552 Doubles (模拟)
- zoj 1760 Doubles
- poj 1552 Doubles 水
- HDU 1301 Doubles
- poj 1552 Doubles
- Doubles
- hdu 1303 Doubles
- POJ-1552 Doubles-二倍关系
- HDU 1303 Doubles(水题)
- SSL 1760——商店选址问题(Floyd最短路)
- hdu 1760