Codeforces Round #640 (Div. 4)题解

Codeforces Round #640

A. Sum of Round Numbers
B. Same Parity Summands
C. K-th Not Divisible by n
D. Alice, Bob and Candies
E. Special Elements
F. Binary String Reconstruction
G. Special Permutation

A. Sum of Round Numbers

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
input
5
5009
7
9876
10000
10
output
2
5000 9
1
7
4
800 70 6 9000
1
10000
1
10

题意
将输入的数字按权分解 例如1234 = 1000+200+30+4 就是该位的数字乘以相应的权重
代码

#include<iostream>
using namespace std;
int a[110];
int main()
{
   
	int t;
	cin>>t;
	while(t--)
	{
   
		int m=1,cnt=0,k=0;
		int n;
		cin>>n;
		while(n!=0)
		{
   
			a[k++] = n%10;
			n/=10;//用数组将每位的数字存起来
		}	
		for(int i=0;i<k;i++)
		{
   
			if(a[i]!=0)//若改位不为0，计数器加一
			cnt++;
		}
		cout<<cnt<<endl;
		for(int i=0;i<k;i++)
		{
   
			if(a[i]!=0)
				cout<<a[i]*m<<" ";
			m*=10;
		}
		cout<<endl;
	}	
	return 0;
}

B. Same Parity Summands

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

题意
从1~n内的数字中选出k个数字，使得所有k个数字和为n，并且这k个数字要么是奇数，要么是偶数。
因为题目已经说明如果有多个答案 打印其中一个就行 那么分类讨论选奇偶即可。
代码

#include<iostream>
using namespace std;
int main()
{
   
	int t;
	cin>>t;
	while(t--)
	{
   
		int n,k;
		cin>>n>>k;
		int res = n-(k