codeforces 538B Quasi Binary

点击打开链接

B. Quasi Binary

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Copy

9

output

Copy

9
1 1 1 1 1 1 1 1 1 

input

Copy

32

output

Copy

3
10 11 11 

题意：给你一个数n，让你分解这个数，只能由0和1组成，不能有01这种情况，并且分的个数最少的情况

思路：最少的话就是各个位数上的最大值，就是能把这个n分成多少个合格的数，要注意如203这种，不是输出101,101,001，所以输出要加以判断

#include<bits/stdc++.h>  
using namespace std;  
typedef long long ll;  
const int inf = 0x3f3f3f3f;  
int main()   
{  
    // freopen("in.txt","r",stdin);
    int n;
    cin>>n;  
    int a[10],b[10];
    int ans=0;
    int num=1;
    while(n)
    {
    	b[num++]=n%10;
    	ans=max(ans,n%10);
    	n/=10;
    }
    int k=1;
    for(int i=num-1;i>=1;i--)
    	a[k++]=b[i];
    printf("%d\n",ans);
    for(int i=1;i<=ans;i++)
    {
    	int j;
    	for(j=1;j<num;j++)
    	{
    		if(a[j])
    		{
    			printf("1");
    			a[j]--;
    			break;
    		}
    	}
    	for(k=j+1;k<num;k++)
    	{
    		if(a[k])
    		{
    			printf("1");
    			a[k]--;
    		}
    		else
    			printf("0");
    	}
    	printf(" ");
    }
    printf("\n");
    return 0;  
}