[1552]Doubles (纯水题) POJ

本文介绍了一个程序设计问题,即在给定的无重复正整数列表中找出成二倍数关系的数对数量。文章提供了完整的C语言实现代码,采用冒泡排序算法进行排序后遍历列表来寻找符合条件的数对。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Doubles
Time Limit: 1000MS
Memory Limit: 10000K
   

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 <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
    int a[110];
    int sum;
    int n=1,i,j,k,t;
    while(scanf("%d",&a[0])&&a[0]!=-1)
    {
        sum=0;
        while(scanf("%d",&a[n++]))
        {
            if(a[n-1]==0)
                break;
        }
        for(i=0; i<n-1; i++)
            for(j=0; j<n-i-1; j++)//对这组由小到大数排序(冒泡排序)
                if(a[j]>a[j+1])
                {
                    t=a[j];
                    a[j]=a[j+1];
                    a[j+1]=t;
                }
        for(i=0; i<n; i++)
        {
            for(j=i+1; j<n; j++)
            {
                if(a[j]==2*a[i])
                  {
                      sum++;
                      break;
                  }
            }
        }
        printf("%d\n",sum);
        n=1;//初始化n的值
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值