POJ-1552
来源:互联网 发布:sql数据库教程视频 编辑:程序博客网 时间:2024/06/06 10:40
Doubles
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15794 Accepted: 8967
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
your program should answer 3, as 2 is twice 1, 4 is twice 2, and 18 is twice 9.
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 02 4 8 10 07 5 11 13 1 3 0-1
Sample Output
320
Source
Mid-Central USA 2003
#include <stdio.h>#include <string.h>int num[50];int main(){ int n, sum; while (scanf("%d", &n), n != -1) { sum = 0; memset(num, 0, sizeof(num)); if (n < 50) { if (num[n]) sum++; num[n] = 2; } if (n%2 == 0) num[n/2] = 1; while (scanf("%d", &n), n) { if (n < 50) { if (num[n]) sum++; num[n] = 2; } if (n%2 == 0) { if (num[n/2] == 2) sum++; else num[n/2] = 1; } } printf("%d\n", sum); } return 0;}
- poj 1552
- POJ-1552
- POJ-1552
- POJ 1552 Doubles
- poj 1552 Doubles 水
- poj 1552 Doubles
- poj 1552 [简单计算]
- POJ 1552 double
- 【POJ-1552】Doubles
- POJ 1552
- Poj 1552 Doubles(水题)
- POJ 1552 Doubles
- poj 1552 Doubles
- POJ 1552 - Doubles
- Doubles - POJ 1552 水题
- POJ 1552 Doubles
- POJ 1552-Doubles
- POJ 1552 Doubles
- kmp算法
- shortestPath
- 程序员杂谈
- HttpClient 多线程处理
- SpringMVC入门之普通配置篇
- POJ-1552
- 数据结构-----哈夫曼树的构造以及遍历
- C++面试宝典2011版
- 忙忙忙
- struts2学习笔记(三) Action(上)
- SpringMVC入门之Annotation篇
- 定位oops的具体代码行
- JS 时间处理和格式转换
- POJ-2105