This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <int,int> ii;
const int N = 1e6 + 5;
const int inf = 2e9;
const int SQ = 300;
int n,ans;
char a[N],b[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL) ; cout.tie(NULL);
cin >> n >> (a + 1) >> (b + 1);
for (int i = 1 ; i <= n ; i++) {
if (b[i] == '0')
continue;
while(i + 1 <= n && b[i + 1] == '1')
i++;
ans++;
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |