若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1654: Doubles

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,259

题目描述

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 i,j,n,count,a[16];
    scanf("%d",&a[0]);
    while(a[0]!=-1) 
    {
        i=0;
        while(a[i]) 
        {
            scanf("%d",&a[++i]);
        }
        n=i;
        count=0;
        for (i=0; i<n; i++)
                    for (j=0; j<n; j++)
                        if(a[i]==2*a[j])
                            count++;
        printf("%dn",count);
        scanf("%d",&a[0]);
    }
    return 0;
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

Dreams孤独患者 Skip 原站点
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist