zoukankan      html  css  js  c++  java
  • Codeforces 538 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
    9
    Output
    9
    1 1 1 1 1 1 1 1 1
    Input
    32
    Output
    3
    10 11 11

    题意就是把一个数用0,1组成的数来代替,让这些数的和为这个数。

    代码:

    #include<bits/stdc++.h>
    using namespace std;
    int a,b,i,m,t=1,g[10];
    int main(){
        cin>>a;
        while(a){
            b=a%10;
            for(i=9;i>9-b;i--)
                g[i]+=t;
            if(b>m) m=b;
            t*=10;
            a/=10;
        }
        cout<<m<<endl;
        for(i=0;i<10;i++){
            if(g[i])
                cout<<g[i]<<" ";
        }
        return 0;
    }
  • 相关阅读:
    一本通 1602:烽火传递
    【笔记】Correlation & Convolution
    【笔记】Supreme Axiom → Heine-Borel Theorem
    CCPC2017
    【BZOJ3513】idiots
    【AGC030D】Inversion Sum
    【Gym102823H】Hamming Distance
    CCPC2018
    【ZJOI2014】力
    【Luogu3803】模板:多项式乘法
  • 原文地址:https://www.cnblogs.com/ZERO-/p/9692691.html
Copyright © 2011-2022 走看看