#include<stdio.h>
#include<unordered_map>
#include<vector>
#include <iostream>
#include <string>
int main()
{
std::string coin1,coin2;
std::cin>>coin1;
std::cin>>coin2;
int size=coin1.length();
bool issame = true;
int count = 0;
for(int i=0;i<size;++i){
if(coin1[i] != coin2[i]) issame = !issame;
if(!issame) count++;
}
std::cout<<count<<std::endl;
}
对哦,一直到遇到下一个不一样的,一轮翻转才结束