1120. Friend Numbers (20)(朋友数)
来源:互联网 发布:钢管舞教学视频软件 编辑:程序博客网 时间:2024/06/18 18:45
- 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:
8
123 899 51 998 27 33 36 12
Sample Output:
4
3 6 9 26
基本的操作,没啥可说的
#include<iostream>#include<set>#include<algorithm>using namespace std;int get_init(int n){ int t=0; while(n!=0) { t+=n%10; n/=10; } return t;}int main(){ int n,num,ans[10005],index1=0; cin>>n; set <int > s; for (int i=0;i<n;i++) { cin>>num; int temp=get_init(num); s.insert(temp); } set<int>::iterator it; // 反向迭代器 set<int>::reverse_iterator it; cout<<s.size()<<endl<<*(s.begin()); for (it =++s.begin();it!=s.end();it++) { cout<<" "<<*it; } return 0;}
- 1120. Friend Numbers (20)(朋友数)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- 1120. Friend Numbers (20)
- PAT(A)- 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)
- 1120. Friend Numbers (20)解题报告
- 1120. Friend Numbers (20) PAT 甲级
- 1120. Friend Numbers (20)[字符串处理]
- Git--ssh
- 考试总结16
- 机器学习入门(一)
- Python函数记录
- CVX介绍——求解器
- 1120. Friend Numbers (20)(朋友数)
- JAVA中使用参数含有游标的存储过程
- web前端笔记
- PAT甲级 1036. Boys vs Girls (25)
- Person
- css 的表格的添加删除
- Maven多模块项目介绍和搭建
- 【hdu2929】【高精度+动规】CQYZ_Vijos_P2102 越大越好
- 埃拉托斯特尼筛法算法复杂度(n*lnlnn)的证明([欧拉数学]素数倒数之和)