算法1
C++ 代码
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=110;
char start[N],end1[N];
int n;
void turn(int i){
if(start[i]=='*')start[i]='o';
else start[i]='*';
}
int main(){
cin>>start>>end1;
n=strlen(start);
int res=0;
for(int i=0;i<n-1;i++){
if(start[i]!=end1[i]){
turn(i),turn(i+1);
res++;
}
}
cout<<res<<endl;
return 0;
}