AcWing 1208. 翻硬币
原题链接
简单
作者:
linkirk
,
2021-02-02 16:35:26
,
所有人可见
,
阅读 277
#include<iostream>
#include<algorithm>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
#define lowbit(x) (x & -x)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define rep(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, a, b) for(int i=(a);i<=(b);i++)
#define REV(i, a, b) for(int i=(a);i>=(b);i--)
#define CLR(a, x) memset(a,x,sizeof a)
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f;
const int maxn = 105;
string line1, line2;
void turn(int x) {
if (line1[x] == '*') {
line1[x] = 'o';
} else {
line1[x] = '*';
}
}
int main() {
cin >> line1 >> line2;
int res = 0;
rep(i, 0, line1.length()-1) {
if (line1[i] != line2[i]) {
res++;
turn(i);
turn(i+1);
}
}
cout << res << endl;
return 0;
}