1120. Friend Numbers (20)

淡淡的烟草味﹌ 2022-05-30 06:14 189阅读 0赞

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<stdio.h>
    int arr[40];
    int main()
    {
    	int i,j,n,m,k,t,sum;
    	scanf("%d",&n);
    	for(i=0;i<n;i++)
    	{
    		scanf("%d",&m);
    		sum=0;
    		while(m!=0)
    		{
    			sum+=m%10;
    			m/=10;
    		}
    		arr[sum]=1;
    	}
    	k=0;
    	for(i=0;i<40;i++)
    	{
    		if(arr[i]==1)
    		{
    			k++;
    		}
    	}
    	printf("%d\n",k);
    	int flag=0;
    	for(i=0;i<40;i++)
    	{
    		if(arr[i]==1)
    		{
    			if(flag==0)
    			{
    				printf("%d",i);
    				flag=1;
    			}
    			else
    			{
    				printf(" %d",i);
    			}
    		}
    	}
    	printf("\n");
    	return 0;
    }

发表评论取消回复

表情：

评论列表（有 0 条评论，189人围观）

还没有评论，来说两句吧...

相关阅读

相关 PAT(甲级) 1120 Friend Numbers (20point(s)) set的使用

题目题目链接思路依次处理每个数字，把每位数字求和后放入set容器中（set容器会自动排序）代码#include <iostream>#include <...

桃扇骨/ 2024年05月08日 06:08/ 0 赞/ 73 阅读

相关【PAT (Advanced Level) Practice】1120 Friend Numbers (20 分)

1120 Friend Numbers (20 分) Two integers are called “friend numbers” if they share the

绝地灬酷狼/ 2022年10月12日 04:14/ 0 赞/ 157 阅读

相关 [C++] C++中friend的使用(friend function and friend class)

对于一个没有定义public访问权限的类，能够让其他的类操作它的私有成员往往是有用的。例如你写了一段binary tree的代码，Node是节点类，如果能够让连接多个节点的函数

川长思鸟来/ 2022年08月26日 00:59/ 0 赞/ 213 阅读

相关 C++中friend的使用(friend function and friend class)

对于一个没有定义public访问权限的类，能够让其他的类操作它的私有成员往往是有用的。例如你写了一段binary tree的代码，Node是节点类，如果能够让连接多个节点的函数

旧城等待，/ 2022年08月03日 08:43/ 0 赞/ 193 阅读

相关 Friend-Graph

Friend-Graph Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (

野性酷女/ 2022年06月10日 13:06/ 0 赞/ 163 阅读

相关 1023. Have Fun with Numbers (20)

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from

清疚/ 2022年05月31日 10:05/ 0 赞/ 158 阅读

相关 1019. General Palindromic Number (20)

A number that will be the same when it is written forwards or backwards is known as a Pa

迈不过友情╰/ 2022年05月30日 20:47/ 0 赞/ 171 阅读

相关 1120. Friend Numbers (20)

Two integers are called "friend numbers" if they share the same sum of their digits, and

淡淡的烟草味﹌/ 2022年05月30日 06:14/ 0 赞/ 190 阅读

相关 1144. The Missing Number (20)

Given N integers, you are supposed to find the smallest positive integer that is NOT in

Dear 丶/ 2022年05月28日 08:25/ 0 赞/ 183 阅读

相关 1100. Mars Numbers (20)

People on Mars count their numbers with base 13: Zero on Earth is called "tret" on M

缺乏、安全感/ 2022年05月28日 06:41/ 0 赞/ 182 阅读