zoukankan      html  css  js  c++  java
  • poj1552

    Doubles
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 19154   Accepted: 11064

    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 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

     
     1 #include <iostream>
     2 #include<cstring>
     3 using namespace std;
     4 
     5 int main()
     6 {
     7     int a[20];
     8     cin>>a[0];
     9     while(a[0]!=-1)
    10     {
    11         int n =1;
    12         int ans = 0;
    13         for(;;n++)
    14         {
    15             cin>>a[n];
    16             if(a[n]==0)
    17                 break;
    18         }
    19         for(int i=0;i<n-1;i++)
    20         {
    21             for(int j=i+1;j<n;j++)
    22                 if(a[i]*2==a[j]||a[i]==a[j]*2)
    23                 ans++;
    24         }
    25         cout<<ans<<endl;
    26         memset(a,0,sizeof(a));
    27         cin>>a[0];
    28     }
    29     return 0;
    30 }
  • 相关阅读:
    DOM--6 向应用程序中加入ajax
    javascript优化--12模式(设计模式)03
    javascript优化--11模式(设计模式)02
    javascript优化--14模式2(DOM和浏览器模式)
    mvc-9测试和调试
    mvc-10部署
    mvc-6依赖管理
    less
    css3 总结03
    css3 总结02
  • 原文地址:https://www.cnblogs.com/jhldreams/p/3911863.html
Copyright © 2011-2022 走看看