zoukankan      html  css  js  c++  java
  • Hdu 1303 Doubles

    Doubles

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 5322    Accepted Submission(s): 3627

    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.

    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

    #include <stdio.h>  
    int main()  
        {  
            int n;  
            while(1)  
            {  
                int cnt = 0;  
                int k = 0,a[100000];  
                while(scanf("%d",&n),n) //以0为输入结束             {  
                    if(n<0)  
                        return 0; //以-1为程序结束                 a[k++] = n;  
                }  
                int i,j;  
                for(i = 0; i<k; i++)  
                {  
                    if(a[i]%2)//符合2倍条件的必定都是偶数                     continue;  
                    for(j = 0; j<k; j++)  
                    {  
                        if(a[i] == 2*a[j])  
                        {  
                            cnt++;  
                            break;  
                        }  
                    }  
                }  
                printf("%d
    ",cnt);
            }  
          
            return 0;  
    }  
    

      

  • 相关阅读:
    荷兰国旗问题
    读取文件中数据到数组
    从五个球中选出3个枚举的简单运用
    搜索算法总结
    匿名对象
    欧几里得距离C++代码实现
    用递归法吧字符串S倒序
    利用系统来完成十进制,十六进制,八进制的转换
    DBHelper 使用的是存储过程
    DBHelper的一个小例子
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7058009.html
Copyright © 2011-2022 走看看