zoukankan      html  css  js  c++  java
  • Doubles water!!!!!!只会水题怎么破

    Doubles

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


    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
     1 #include <iostream>
     2 #include <cstdio>
     3 using namespace std;
     4 int main()
     5 {
     6     int n;
     7     int a[16];
     8     //freopen("in.txt","r",stdin);
     9     while(cin>>n&&n!=-1)
    10     {
    11         int count=1,i=0,j=0,sum=0;
    12         a[0]=n;
    13         while(cin>>a[count++]&&a[count-1]!=0);
    14         count-=1;
    15         for(i=0;i<count;i++)
    16         {
    17             for(j=0;j<count;j++)
    18             {
    19                 if(a[i]==2*a[j])
    20                     sum++;
    21             }
    22         }
    23         cout<<sum<<endl;
    24     }
    25 }
     
  • 相关阅读:
    从Java到C++——常量的使用规则
    LintCode 二叉树的遍历 (非递归)
    POJ 3592 Instantaneous Transference(强连通+DP)
    怎样给UINavigationBar加入button?
    《Spring技术内幕》笔记-第四章 Spring MVC与web环境
    HDU 4714 Tree2cycle(树型DP)
    hdu 1102 Constructing Roads(kruskal || prim)
    [Android随笔]内存泄漏以及内存溢出
    保存数据同一时候查询保存数据记录的ID
    8086的储存器编址
  • 原文地址:https://www.cnblogs.com/a1225234/p/4618581.html
Copyright © 2011-2022 走看看