Codeforces Round 958 (Div. 2)

##A. Split the Multiset

A multiset is a set of numbers in which there can be equal elements, and the order of the numbers does not matter. For example, { 2 , 2 , 4 } \{2,2,4\} {2,2,4} is a multiset.

You have a multiset $S$. Initially, the multiset contains only one positive integer $n$. That is, S = { n } S=\{n\} S={n}. Additionally, there is a given positive integer $k$.

In one operation, you can select any positive integer $u$ in $S$ and remove one copy of $u$ from $S$. Then, insert no more than $k$ positive integers into $S$ so that the sum of all inserted integers is equal to $u$.

Find the minimum number of operations to make $S$ contain $n$ ones.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1\le t\le 1000$). Description of the test cases follows.

The only line of each testcase contains two integers $n,k$ ($1\le n\le 1000,2\le k\le 1000$).

Output

For each testcase, print one integer, which is the required answer.
Example
input
4
1 5
5 2
6 3
16 4
output
0
4
3
5

Note

For the first test case, initially S = { 1 } S=\{1\} S={1}, already satisfying the requirement. Therefore, we need zero operations.

For the second test case, initially S = { 5 } S=\{5\} S={5}. We can apply the following operations:

• Select $u=5$, remove $u$ from $S$, and insert $2,3$ into $S$. Now, S = { 2 , 3 } S=\{2,3\} S={2,3}.
• Select $u=2$, remove $u$ from $S$, and insert $1,1$ into $S$. Now, S = { 1 , 1 , 3 } S=\{1,1,3\} S={1,1,3}.
• Select $u=3$, remove $u$ from $S$, and insert $1,2$ into $S$. Now, S = { 1 , 1 , 1 , 2 } S=\{1,1,1,2\} S={1,1,1,2}.
• Select $u=2$, remove $u$ from $S$, and insert $1,1$ into $S$. Now, S = { 1 , 1 , 1 , 1 , 1 } S=\{1,1,1,1,1\} S={1,1,1,1,1}.

Using $4$ operations in total, we achieve the goal.

For the third test case, initially S = { 6 } S=\{6\} S={6}. We can apply the following operations:

• Select $u=6$, remove $u$ from $S$, and insert $1,2,3$ into $S$. Now, S = { 1 , 2 , 3 } S=\{1,2,3\} S={1,2,3}.
• Select $u=2$, remove $u$ from $S$, and insert $1,1$ into $S$. Now, S = { 1 , 1 , 1 , 3 } S=\{1,1,1,3\} S={1,1,1,3}.
• Select $u=3$, remove $u$ from $S$, and insert $1,1,1$ into $S$. Now, S = { 1 , 1 , 1 , 1 , 1 , 1 } S=\{1,1,1,1,1,1\} S={1,1,1,1,1,1}.

Using $3$ operations in total, we achieve the goal.

For the fourth test case, initially S = { 16 } S=\{16\} S={16}. We can apply the following operations:

• Select $u=16$, remove $u$ from $S$, and insert $4,4,4,4$ into $S$. Now, S = { 4 , 4 , 4 , 4 } S=\{4,4,4,4\} S={4,4,4,4}.
• Repeat for $4$ times: select $u=4$, remove $u$ from $S$, and insert $1,1,1,1$ into $S$.

Using $5$ operations in total, we achieve the goal.

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    cin >> t;
    int cnt = 0;
    while (t--)
    {   
        int n, k;
        cin >> n >> k;
        if (n == 1)
        {
            cout << "0" << '\n';
            continue;//跳出本次,刚开始这里没写！！！
        }
        cnt = 0;
        while (n > k)
        {
            n = n - k + 1;
            cnt++;
        }   
        cout << cnt + 1 << '\n';
    }
    return 0;
}

##B. Make Majority

You are given a sequence $[a_1,\dots ,a_n]$ where each element $a_i$ is either $0$ or $1$. You can apply several (possibly zero) operations to the sequence. In each operation, you select two integers $1\le l\le r\le |a|$ (where $|a|$ is the current length of $a$) and replace $[a_l,\dots ,a_r]$ with a single element $x$, where $x$ is the majority of $[a_l,\dots ,a_r]$.

Here, the majority of a sequence consisting of $0$ and $1$ is defined as follows: suppose there are $c_0$ zeros and $c_1$ ones in the sequence, respectively.

• If $c_0\ge c_1$, the majority is $0$.
• If $c_0<c_1$, the majority is $1$.

For example, suppose $a=[1,0,0,0,1,1]$. If we select $l=1,r=2$, the resulting sequence will be $[0,0,0,1,1]$. If we select $l=4,r=6$, the resulting sequence will be $[1,0,0,1]$.

Determine if you can make $a=[1]$ with a finite number of operations.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1\le t\le 4\cdot 10^4$). Description of the test cases follows.

The first line of each testcase contains one integer $n$ ($1\le n\le 2\cdot 10^5$).

The second line of each testcase contains a string consisting of $0$ and $1$, describing the sequence $a$.

It’s guaranteed that the sum of $n$ over all testcases does not exceed $2\cdot 10^5$.

Output

For each testcase, if it’s possible to make $a=[1]$, print YES. Otherwise, print NO. You can output the answer in any case (upper or lower). For example, the strings yEs, yes, Yes, and YES will be recognized as positive responses.
Example
input
5
1
0
1
1
2
01
9
100000001
9
000011000
output
No
Yes
No
Yes
No

Note

In the fourth testcase of the example, initially $a=[1,0,0,0,0,0,0,0,1]$. A valid sequence of operations is:

1. Select $l=2,r=8$ and apply the operation. $a$ becomes $[1,0,1]$.
2. Select $l=1,r=3$ and apply the operation. $a$ becomes $[1]$.
   思路：因为选定的区域都变为一个数，所以连续的0可以记为一个，然后比较0，1的多少

#include <bits/stdc++.h>
using namespace std;
int main() {
	int t;
	cin >> t;
	while (t--) {
		int sum0 = 0, sum1 = 0;
		int n;
		cin >> n;
		string s;
		cin >> s;
		s = ' ' + s;
		for (int i = 1; i <= n; i++) {
			if (s[i] != s[i + 1] && s[i] == '0')//连续的0可以变为一个；
				sum0++;
			else if (s[i] == '1')
				sum1++;
		}
		if (sum1 > sum0)//这个时候只有1多就能最终是1
			cout << "Yes" << '\n';
		else
			cout << "No" << '\n';
	}
	return 0;
}

##C. Increasing Sequence with Fixed OR

You are given a positive integer $n$. Find the longest sequence of positive integers $a=[a_1,a_2,\dots ,a_k]$ that satisfies the following conditions, and print the sequence:

• $a_i\le n$ for all $1\le i\le k$.
• $a$ is strictly increasing. That is, $a_i>a_{i-1}$ for all $2\le i\le k$.
• $a_i|a_{i-1}=n$ for all $2\le i\le k$, where $|$ denotes the bitwise OR operation.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1\le t\le 1000$). Description of the test cases follows.

The only line of each test case contains one integer $n$ ($1\le n\le 10^{18}$).

It’s guaranteed that the sum of lengths of the longest valid sequences does not exceed $5\cdot 10^5$.

Output

For each testcase, print two lines. In the first line, print the length of your constructed sequence, $k$. In the second line, print $k$ positive integers, denoting the sequence. If there are multiple longest sequences, you can print any of them.
Example
input
4
1
3
14
23
output
1
1
3
1 2 3
4
4 10 12 14
5
7 18 21 22 23
思路：位运算，用n减掉二进制表示的n位置上是1所代表的值，所得的值就是所求的值，从小到大，包括本身

#include <iostream>
using namespace std;
int ans[105], t;

int main() {
	int T;
	cin >> T;
	while (T--) {
		long long n;
		scanf("%lld", &n);
		t = 0;
		for (int i = 0; (1LL << i) <= n; ++i)
			if ((1LL << i)&n )
				ans[++t] = i;

		if (t == 1) {
			printf("1\n");
			printf("%lld\n", n);
		} else {
			printf("%d\n", t + 1);
			for (int i = t; i >= 1; --i)
				printf("%lld ", n - (1LL << ans[i]));
			printf("%lld\n", n);
		}
	}
	return 0;
}