Day 41 C. Ternary XOR

Problem
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 ci=(ai+bi)%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^4) — 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^4) — 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⋅104 (∑n≤5⋅10^4).

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.

Example
input
4
5
22222
5
21211
1
2
9
220222021
output
11111
11111
11000
10211
1
1
110111011
110111010

#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<stdio.h>
#include<limits.h>
#include<cmath>
#include<set>
#include<map>
#define ll long long
using namespace std;
int cc[50005];
int dd[50005];
char bb[50005];
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        memset(cc, 0, 50005);
        memset(dd, 0, 50005);
        int a;
        bool f = false;
        cin >> a;
        for (int i = 0; i < a; i++)
        {
            cin >> bb[i];
        }
        for (int i = 0; i<a; i++)
        {
            if (bb[i] != '1' && !f)
            {
                cc[i] += int((bb[i] - '0' / 2)-24)/2;
                dd[i] += int((bb[i] - '0' / 2)-24)/2;
            }
            else if (bb[i] == '1' && !f)
            {
                cc[i] = 1;
                dd[i] = 0;
                f = true;
            }
            else if (f)
            {
                cc[i] = 0;
                dd[i] = int(bb[i] - '0');
            }
        }
        for (int i = 0; i < a; i++)
        {
            cout << cc[i];
        }
        cout << endl;
        for (int i = 0; i < a; i++)
        {
            cout << dd[i];
        }
        cout << endl;
    }
    return 0;
}