225822026-01-15 11:33:50PKBTükörtojás (75 pont)cpp17Accepted 75/758ms748 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;

    string s, t;
    cin >> s >> t;

    int steps = 0;
    bool flipped = false;

    for (int i = n - 1; i >= 0; i--) {
        char cur = s[i];
        if (flipped) {
            cur = (cur == 'S' ? 'F' : 'S');
        }

        if (cur != t[i]) {

            steps++;
            flipped = !flipped;
        }
    }

    cout << steps;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms508 KiB
2Accepted0/04ms524 KiB
3Accepted5/51ms500 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms332 KiB
8Accepted5/51ms596 KiB
9Accepted5/51ms316 KiB
10Accepted5/51ms316 KiB
11Accepted5/51ms316 KiB
12Accepted5/57ms564 KiB
13Accepted5/58ms748 KiB
14Accepted5/57ms748 KiB
15Accepted5/57ms564 KiB
16Accepted5/57ms620 KiB
17Accepted5/57ms712 KiB