第一周训练：C

C

A number is ternary if it contains only digits 0, 1 and 2. For example, the following numbers are ternary: 1022, 11, 21, 2002.

You are given a long ternary number x. The first (leftmost) digit of x is guaranteed to be 2, the other digits of x can be 0, 1 or 2.

Let’s define the ternary XOR operation ⊙ of two ternary numbers a and b (both of length n) as a number c=a⊙b of length n, where c_i=(a_i+b_i)%3 (where % is modulo operation). In other words, add the corresponding digits and take the remainders of the sums when divided by 3. For example, 10222⊙11021=21210.

Your task is to find such ternary numbers a and b both of length n and both without leading zeros that a⊙b=x and max(a,b) is the minimum possible.

You have to answer t independent test cases.
input
The first line of the input contains one integer t (1≤t≤10⁴) — the number of test cases. Then t test cases follow. The first line of the test case contains one integer n (1≤n≤5⋅10⁴) — the length of x. The second line of the test case contains ternary number x consisting of n digits 0,1 or 2. It is guaranteed that the first digit of x is 2. It is guaranteed that the sum of n over all test cases does not exceed 5⋅10⁴(∑n≤5⋅10⁴).

output
For each test case, print the answer — two ternary integers a and b both of length n and both without leading zeros such that a⊙b=x and max(a,b) is the minimum possible. If there are several answers, you can print any.

input
4
5
22222
5
21211
1
2
9
220222021

Output
11111
11111
11000
10211
1
1
110111011
110111010

思路：第一位肯定是2，先将两个串分别加上1，然后把上边那个串定义为数字大的串，相反，下边为小的字符串，然后扫描输入的串，如果第一次出现1，则上边串为1，下边串为0，这是，上边的串就是大数字了，下边的为小数字，由于要求最大值为最小，所以接下来保证上边的串接收到的都是最小的数字，就保证上边的串比下边大，且上边的数字是最小的

import java.util.Scanner;

public class C {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int i = 0; i < t; i++) {
			int m = sc.nextInt();
			sc.nextLine();
			String str = sc.nextLine();
			StringBuilder s1 = new StringBuilder(m);
			StringBuilder s2 = new StringBuilder(m);
			s1.append("1");
			s2.append("1");
			boolean key = false;//用来判断1是否是第一次出现
			for (int j = 1; j < m; j++) {
				if(str.charAt(j) == '1' && key == false) {
					s1.append("1");
					s2.append("0");
					key = true;
				}else if(str.charAt(j) == '1' && key == true) {
					s1.append("0");
					s2.append("1");
				}
				else if(str.charAt(j) == '0'){
					s1.append("0");
					s2.append("0");
				}else if(str.charAt(j) == '2' && key == true){
					s1.append("0");
					s2.append("2");
				}else if(str.charAt(j) == '2' && key == false) {
					s1.append("1");
					s2.append("1");
				}
			}
			System.out.println(s1);
			System.out.println(s2);
		}
		sc.close();
		
	}
}