// Problem: B. Gregor and the Pawn Game
// Contest: Codeforces - Codeforces Round #736 (Div. 2)
// URL: https://codeforces.com/contest/1549/problem/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-02-15 02:38:01
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fir first
#define pb push_back
#define sec second
#define sortall(x) sort((x).begin(),(x).end())
inline int read () {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f?-x:x;
}
template<typename T> void print(T x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) print(x/10);
putchar(x % 10 + '0');
}
const int N = 2e5 +10;
int n;
string a, b;
bool st[N];
void solve() {
memset(st, 0, sizeof st);
cin >> n >> a >> b;
int ans = 0;
for (int i = 0; i < n; i ++) {
if (i % 2 == 0) {
if (b[i] == '0') continue;
if (i >= 1 && !st[i - 1] && a[i - 1] == '1') {
st[i - 1] = 1;
ans ++;
}
else if (a[i] == '0' && !st[i]) {
ans ++;
st[i] = 1;
}
else if (a[i+ 1] == '1' && !st[i + 1]) {
ans ++;
st[i + 1] = 1;
}
}
else {
if (b[i] == '0') continue;
if (a[i - 1] == '1' && !st[i - 1]) {
ans ++;
st[i - 1] = 1;
}
else if (a[i] == '0' && !st[i]) {
st[i] = 1;
ans ++;
}
else if (i < n - 1 && !st[i + 1] && a[i + 1] == '1') {
ans ++;
st[i + 1] = 1;
}
}
}
cout << ans << endl;
}
int main () {
int t;
cin >> t;
while (t --) solve();
return 0;
}
考虑所有可能可以发现从左到右检查是最好的方案。 考虑所有的方案,这里只有三种方案