import math
def intlist():
return([int(i) for i in input().split(" ")])
def stringlist():
return (input().split(" "))
def yes(t):
if t:
return("YES")
return("NO")
def printjoin(l,str=False):
if str:
l=[str(i) for i in l]
return(" ".join(l))
def power_of_two(n):
b=bin(n)[2:]
return(int(b)==10**(len(b)-1))
def bit_count(n):
return(bin(n).count('1'))
def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
def isint(str):
try:
int(str)
return True
except ValueError:
return False
def solve():
n=int(input())
a=list(input())
b=list(input())
ans=0
for i in range(n):
if b[i]!='1':
continue
if i!=0 and a[i-1]=='1':
a[i-1]="2"
ans+=1
elif a[i]=='0':
a[i]=='2'
ans+=1
elif i!=n-1 and a[i+1] == "1":
a[i+1]="2"
ans+=1
return(ans)
t = input()
for tt in range(int(t)):
print(solve())
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n, x; cin >> n;
string s, s2;
int result[n] = {0};
for(int i = 0; i < n; i++)
{
cin >> x >> s >> s2;
bool reach[x] = {false};
for(int j = 0; j < x; j++)
{
if(s2[j] == '1')
{
if(s[j] == '0' && reach[j] == false)
{
result[i]++;
reach[j] = true;
}
else
{
if(j == 0)
{
if(s[j+1] == '1' && reach[j+1] == false)
{
result[i]++;
reach[j+1] = true;
}
}
else
{
if(s[j-1] == '1' && reach[j-1] == false)
{
result[i]++;
reach[j-1] = true;
}
else if(j != x-1)
{
if(s[j+1] == '1' && reach[j+1] == false)
{
result[i]++;
reach[j+1] = true;
}
}
}
}
}
}
}
for(auto i : result)
cout << i << endl;
return 0;
}
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |
1630C - Paint the Middle | 1630D - Flipping Range |