TOJ 1276: Doubles
来源:互联网 发布:百度云限速脚本 知乎 编辑:程序博客网 时间:2024/06/05 19:03
1276: Doubles
描述
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.
输入
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.
输出
The output will consist of one line per input list, containing a count of the items that are double some other item.
样例输入
1 4 3 2 9 7 18 22 0
2 4 8 10 0
7 5 11 13 1 3 0
-1
样例输出
3
2
0
#include <stdio.h>
int main()
{
int a[100],i,s,j,k,b;
while(scanf("%d",&a[0])!=EOF)
{
s=0;
if(a[0]==-1)
break;
i=0;
while(a[i]!=0)
{
i++;
scanf("%d",&a[i]);
}
for(j=0;j<i;j++)
{
b=2*a[j];
for(k=0;k<i;k++)
{
if(b==a[k])
s++;
}
}
printf("%d\n",s);
}
return 0;
}
- TOJ 1276: Doubles
- Doubles
- Doubles
- Doubles
- Doubles
- Doubles
- Doubles
- Doubles
- zoj1760 Doubles
- HDU1303:Doubles
- hdu1303 Doubles
- poj1552--Doubles
- 1303:Doubles
- 【POJ1552】:Doubles
- B - Doubles
- poj1552 Doubles
- HDU1303 Doubles
- HDOJ1303 Doubles
- Python简谈
- Windows和linux操作socket的区别(简单对比)
- 个人总结67
- MySQL 5.7.20 安装教程
- 用fallocate进行"文件预留"或"文件打洞"
- TOJ 1276: Doubles
- Android_7.1.1_r6源码下载
- 打印大X
- 71. Simplify Path
- 递推HDU2048,2049
- Android EditText控件输入指定长度后自动隐藏输入法
- TOJ 5014: 说反话
- 客户关系管理系统6
- 考题篇(5.4) NSE4 12. 路由 ❀ 飞塔 (Fortinet) 网络安全专家