zoukankan      html  css  js  c++  java
  • B

    这道题可把我憋死了,哎!

    刚開始定义a【15】,执行错误,无语呀。!!!!

    Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

    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
    #include<iostream>
    #include <algorithm>
    using namespace std;
    int main()
    {
    	int a[100],i,n,j,k;;
    cin>>a[0];
    	while(a[0]!=-1)
    	{
    	i=1;
    	
    	n=0;
    
    
    	while(a[0]&&cin>>a[i]&&a[i])
    	{
    		i++;
    	}
    
    	for(j=0;j<=i;j++)
    		for(k=j+1;k<=i;k++)
    			if(2*a[j]==a[k]||a[j]==2*a[k])
    			{n++;}
        
    
        cout<<n<<endl;
    	cin>>a[0];
    	}
    
    return 0;
    }
    


  • 相关阅读:
    Iterator 迭代器
    Collection-List
    Collection-Set
    Collection
    多线程
    面向对象<高级>知识点
    链表
    面向对象<基础>知识点
    三层架构和MVC模式详解
    impala为什么比hive快
  • 原文地址:https://www.cnblogs.com/wgwyanfs/p/7379981.html
Copyright © 2011-2022 走看看