2021-05-30

最新推荐文章于 2022-03-16 10:36:59 发布

￡xilm€

最新推荐文章于 2022-03-16 10:36:59 发布

阅读量48

点赞数

分类专栏：思维

本文链接：https://blog.csdn.net/qq_52898168/article/details/117399062

版权

思维专栏收录该内容

12 篇文章 0 订阅

订阅专栏

该篇博客介绍了一个C++程序，该程序接受一个正整数n，然后将其表示为最少数量的准二进制数（仅包含0和1的十进制数）之和。程序首先读取输入的十进制数，然后通过迭代转换其每一位，构造出准二进制数，并存储这些数。最后，程序输出最少的准二进制数个数以及这些数的组合，展示了一种有效的数字转换和组合优化方法。

摘要由CSDN通过智能技术生成

A number is called quasibinary if its decimal representation contains only digits 0 or 1. For example, numbers 0, 1, 101, 110011 — are quasibinary and numbers 2, 12, 900 are not.

You are given a positive integer n. Represent it as a sum of minimum number of quasibinary numbers.

Input
The first line contains a single integer n (1 ≤ n ≤ 106).

Output
In the first line print a single integer k — the minimum number of numbers in the representation of number n as a sum of quasibinary numbers.

In the second line print k numbers — the elements of the sum. All these numbers should be quasibinary according to the definition above, their sum should equal n. Do not have to print the leading zeroes in the numbers. The order of numbers doesn’t matter. If there are multiple possible representations, you are allowed to print any of them.

Examples
Input
9
Output
9
1 1 1 1 1 1 1 1 1
Input
32
Output
3
10 11 11

#include"stdio.h"
#include"string.h"
#include"algorithm"
using namespace std;
int a[1011],b[1011];
char c[1010];
int dd(int l)
{
	int s=0;
	for(int i=0; i<l; i++)
	{	
		if(a[i]!=0)
		{
			s=s*10+1;
			a[i]--;
		}
		else
			s=s*10+0;
	}
	return s;
}
int main()
{
	int i,j,k=0,x,n,m,l;
	scanf("%s",c);
	l=strlen(c);
	for(i=0; i<l; i++)
		a[i]=c[i]-'0';
	while((x=dd(l))&&x)
	{
		b[k++]=x;
	}
	sort(b,b+k);
	printf("%d\n",k);
	for(i=0; i<k; i++)
		if(!i)
			printf("%d",b[i]);
		else
			printf(" %d",b[i]);
	return 0;
}