Div-2萌新觉得T2简单，于是先做的T2，结果是紫题

磕了两个小时的代码，只对了一个点（

请大佬hack（

#include<bits/stdc++.h>
using namespace std;
int n,T;
int main(){
	cin>>T;
	while(T--){
		int fan,gai,tot=1;
		bool fan_gg=0,gai_gg=0,kai=0;
		string a,b;
		cin>>a>>b;
		if(a==b){
			cout<<0<<endl;
			continue;
		}
		for(int i=1;i<=a.size();i++){
			if(a[i]==b[i])kai=1;
			if(b[i]==b[i-1]&&gai_gg==0)gai++;
			else gai_gg=1;
			if(a[i]!=b[i]&&fan_gg==0)fan++;
			else fan_gg=1;
			if(a[i]==b[i])continue;
			if(fan_gg+gai_gg==2){
				tot++;
				fan_gg=0,gai_gg=0;
			}
		}
		cout<<tot<<endl;
	}
}