This is the easy version of the problem. The difference between the versions is the constraint on n and the required number of operations. You can make hacks only if all versions of the problem are solved.
There are two binary strings a and b of length n (a binary string is a string consisting of symbols 0 and 1). In an operation, you select a prefix of a, and simultaneously invert the bits in the prefix (0 changes to 1 and 1 changes to 0) and reverse the order of the bits in the prefix.
For example, if a=001011 and you select the prefix of length 3, it becomes 011011. Then if you select the entire string, it becomes 001011.
Your task is to transform the string a into b in at most 3n operations. It can be proved that it is always possible.
Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases. Next 3t lines contain descriptions of test cases.
The first line of each test case contains a single integer n (1≤n≤1000) — the length of the binary strings.
The next two lines contain two binary strings a and b of length n.
It is guaranteed that the sum of n across all test cases does not exceed 1000.
Output
For each test case, output an integer k (0≤k≤3n), followed by k integers p1,…,pk (1≤pi≤n). Here k is the number of operations you use and pi is the length of the prefix you flip in the i-th operation.
题目大意:
给出 t 组样例,对于每组样例给出一个长度 n ,然后输入两个01串a b,然后有这样一个操作:选择长度为 i 的前缀,全部取反并逆置,询问能否在3n个操作以内使a b 相等,输出操作次数以及每次操作所选择的前缀。
解题思路:
答案是一定能通过3 n个操作使a b 相等,我们可以一个一个的判断,如果s i != s1 i ,则可以先取i (取反并逆置),然后再取1,改第一个字母,然后再取 i ,取反逆置,就可以实现单个字母的修改,这样是一定能在3n个操作之内实现a == b 的。
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll t,n,x[100005];
string a,b;
cin>>t;
while(t--)
{
int w=0,k=0;
cin>>n;
cin>>a>>b;
for(int i=0;i<a.length();i++)
{
if(a[i]!=b[i])
{
k+=3;
x[w++]=i+1;
x[w++]=1;
x[w++]=i+1;
}
}
cout<<k;
for(int i=0;i<w;i++)
cout<<" "<<x[i];
cout<<endl;
}
}