Codeforces Round #640 (Div. 4)

好长时间没来博客了 cf第一次div4 写个题解吧 嘿嘿
A. Sum of Round Numbers
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A positive (strictly greater than zero) integer is called round if it is of the form d00…0. In other words, a positive integer is round if all its digits except the leftmost (most significant) are equal to zero. In particular, all numbers from 1 to 9 (inclusive) are round.

For example, the following numbers are round: 4000, 1, 9, 800, 90. The following numbers are not round: 110, 707, 222, 1001.

You are given a positive integer n (1≤n≤104). Represent the number n as a sum of round numbers using the minimum number of summands (addends). In other words, you need to represent the given number n as a sum of the least number of terms, each of which is a round number.

Input
The first line contains an integer t (1≤t≤104) — the number of test cases in the input. Then t test cases follow.

Each test case is a line containing an integer n (1≤n≤104).

Output
Print t answers to the test cases. Each answer must begin with an integer k — the minimum number of summands. Next, k terms must follow, each of which is a round number, and their sum is n. The terms can be printed in any order. If there are several answers, print any of them.

Example
inputCopy
5
5009
7
9876
10000
10
outputCopy
2
5000 9
1
7
4
800 70 6 9000
1
10000
1
10
题解：把数拆成 x00…0的和 看样例就能懂了

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fast ios_base::sync_with_stdio(0), cin.tie(0)
int n,k;
int main()
{
   
    int K;cin>>K;
    while(K--)
    {
   
        string s;
        cin>>s;
        n=s.length();int v=1;
        s="l"+s;int ans=0;
        for(int i=n;i>=1;i--)if((s[i]-'0')!=0)ans++;cout<<ans<<endl;
        for(int i=n;i>=1;i--)
        {
   
            if((s[i]-'0')!=0)
            cout<<(s[i]-'0')*v<<" ";v*=10;
        }cout<<endl;
    }
    return 0;
}

B. Same Parity Summands
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given two positive integers n (1≤n≤109) and k (1≤k≤100). Represent the number n as the sum of k positive integers of the same parity (have the same remainder when divided by 2).

In other words, find a1,a2,…,ak such that all ai>0, n=a1+a2+…+ak and either all ai are even or all ai are odd at the same time.

If such a representation does not exist, then report it.

Input
The first line contains an integer t (1≤t≤1000) — the number of test cases in the input. Next, t test cases are given, one per line.

Each test case is two positive integers n (1≤n≤109) and k (1≤k≤100).

Output
For each test case print:

YES and the required values ai, if the answer exists (if there are several answers, print any of them);
NO if the answer does not exist.
The letters in the words YES and NO can be printed in any case.

Example
inputCopy
8
10 3
100 4
8 7
97 2
8 8
3 10
5 3
1000000000 9
outputCopy
YES
4 2 4
YES
55 5 5 35
NO
NO
YES
1 1 1 1 1 1 1 1
NO
YES
3 1 1
YES
111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111110 111111120
题解：问这个数能否拆分为k个奇数或k个偶数的和
如果是个奇数就判断是否可以用k-1个1 和一个 n-（k-1）构成 注意判断是否成立 同理偶数的话就是用k-1个2和一个n-2*（k-1）构成 注意判断是否成立

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fast ios_base::sync_with_stdio(0), cin.tie(0)
int n,k;
int main()
{
   
    int K;cin>>K;
    while(K--)
    {
   
        cin>>n>>k;
        if(n%2==0&&n>=2*k)
        {
   
            cout<<"YES\n";
            for(int i=1;i<k;i++)cout<<2<<" ";
            cout<<n-2*(k-1