1120. Friend Numbers
来源:互联网 发布:网络公开课网站 编辑:程序博客网 时间:2024/04/28 06:02
1120. Friend Numbers (20)
Two integers are called "friend numbers" if they share the same sum of their digits, and the sum is their "friend ID". For example, 123 and 51 are friend numbers since 1+2+3 = 5+1 = 6, and 6 is their friend ID. Given some numbers, you are supposed to count the number of different friend ID's among them. Note: a number is considered a friend of itself.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N. Then N positive integers are given in the next line, separated by spaces. All the numbers are less than 104.
Output Specification:
For each case, print in the first line the number of different frind ID's among the given integers. Then in the second line, output the friend ID's in increasing order. The numbers must be separated by exactly one space and there must be no extra space at the end of the line.
Sample Input:8123 899 51 998 27 33 36 12Sample Output:
43 6 9 26#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string.h>#include<set>#define MAXSIZE 100using namespace std;set<int> out;int calSum(int N){ int i=0,temp=0; while(N) { temp+=N%10; N=N/10; i++; } return temp;}int main(){ int N,M; cin>>N; while(N--) { cin>>M; int index=calSum(M); out.insert(index); } cout<<out.size()<<endl; for(set<int>::iterator it =out.begin();it!=out.end();it++) { if(it!=out.begin()) cout<<" "; cout<<*it; } return 0;}
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 【PAT】1120. Friend Numbers
- 1120. Friend Numbers
- 1120. Friend Numbers (20)
- 1120. Friend Numbers
- 1120. Friend Numbers 解析
- pat 1120. Friend Numbers
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- PAT--1120. Friend Numbers (20)
- PAT_A 1120. Friend Numbers (20)
- 1120. Friend Numbers (20) <set>
- 1120. Friend Numbers (20) 统计友元
- PAT - 甲级 - 1120. Friend Numbers (20)
- LeetCode_389-Find the Difference
- php使用Iterator接口,逐行遍历文件
- Java语言中==和equals的区别详解
- 正方形共享存储器
- Gotta Catch Em' All!_Codeforces
- 1120. Friend Numbers
- C语言中如何添加背景音乐
- 删除了目录卸载或安装出现Invalid drive错误
- pom.xml详解
- C++Primer第五版 第十二章习题答案(21~30)
- linux下的hadoop配置 sbin/start-all.sh datanode守护进程启动失败----解决方案
- 【剑指Offer】把二叉树打印成多行
- Mysql 破坏root 账户 修复
- k-th divisor_Codeforces