最多可以进行 $3n$ 次操作,可以考虑对每个不同的位独立进行操作,如何操作才能只操作一位而又不影响其它位呢?设想要只翻转第 $i$ 位,可以这样操作:先翻转 $[1, i]$,然后翻转 $[1, 1]$,最后翻转 $[1, i]$。这样操作三次,恰好只改变了第 $i$ 位。
// Date: Tue Dec 12 22:47:02 2023
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double eps = 1e-8;
const int dir[8][2] = {
{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1},
};
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<int, int> PII;
const ull Pr = 131;
#define For(i, a, b) for (int i = int(a); i < int(b); ++i)
#define Rof(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define For1(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define Rof1(i, a, b) for (int i = int(b); i >= int(a); --i)
#define ForE(i, j) for (int i = h[j]; i != -1; i = ne[i])
#define f1 first
#define f2 second
#define pb push_back
#define has(a, x) (a.find(x) != a.end())
#define nonempty(a) (!a.empty())
#define all(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#ifdef _DEBUG
#define debug1(x) cout << #x " = " << x << endl;
#define debug2(x, y) cout << #x " = " << x << " " #y " = " << y << endl;
#define debug3(x, y, z) \
cout << #x " = " << x << " " #y " = " << y << " " #z " = " << z << endl;
#else
#define debug1
#define debug2
#define debug3
#endif
int t, n;
string a, b;
int main(void) {
#ifdef _DEBUG
freopen("1381a1.in", "r", stdin);
#endif
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> t;
while (t--) {
cin >> n >> a >> b;
VI res;
For(i, 0, n) {
if (a[i] != b[i]) {
res.pb(i + 1);
res.pb(1);
res.pb(i + 1);
}
}
int len = SZ(res);
if (!len) {
cout << len << '\n';
} else {
cout << len << ' ';
for (auto x : res) {
cout << x << ' ';
}
cout << '\n';
}
}
return 0;
}