Codeforces Round #640 (Div. 4)日常训练

最新推荐文章于 2021-11-16 14:34:17 发布

ArwenNi

最新推荐文章于 2021-11-16 14:34:17 发布

阅读量376

点赞数

本文链接：https://blog.csdn.net/ArwenNi/article/details/106154409

版权

本文介绍了Codeforces Round #640 (Div. 4)比赛中的六道编程题目，包括题目要求、输入输出格式及样例。A题要求将数字表示为最少项的圆数之和；B题需找到满足特定条件的同余数和；C题找出第k个不被n整除的正整数；D题涉及Alice和Bob吃糖果的游戏，计算他们吃的糖果总数量；E题寻找数组中特殊元素的数量；F题要求根据连续子串的1数量重建二进制字符串。文章还分享了作者在D题上的失误。

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

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

#include<iostream>
using namespace std;
int main(){
   
	int t,m,n,ans,k,i,j;
	int a[1000];
	bool f;
	cin>>t;
	while(t--){
   
		ans=0;
		cin>>n;
		f=true;
		if(n==10000){
   
			cout<<1<<endl;
			cout<<10000<<endl; 
			f=false;
		}
		else if(n>1000){
   
			a[ans]=1000*(n/1000);
			ans=ans+1;
			n=n%1000;
		}
		if (n>100){
   
			a[ans]=100*(n/100);
			ans=ans+1;
			n=n%100;
		}
		if(n>10){
   
			a[ans]=10*(n/10);
			ans=ans+1;
			n=n%10;
		}
		if(n>0 && n!=10000){
   
			a[ans]=n;
			ans=ans+1;
		}
		if(f){
   
			cout<<ans<<endl;
			for(i=0;i<ans;i++) cout<<a[i]<<" ";
			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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
int t, n, k;
int a[1100000];
int main() {
   
	cin >> t;
	for (int i = 1; i <= t; i++) {
   
		cin >> n >> k;
		if (k > n) cout << "NO" << endl;
		else if (n % k == 0) {
   
			cout