5.KMP算法

#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int mid_pos = -1;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'M') {
mid_pos = i;
break;
}
}
if (mid_pos == -1) {
cout << 0 << endl;
return 0;
}
int countK = 0;
for (int i = 0; i < mid_pos; i) {
if (s[i] == 'K') {
countK;
}
}
int countP = 0;
for (int i = mid_pos + 1; i < s.size(); i) {
if (s[i] == 'P') {
countP;
}
}
cout << countK * countP << endl;
return 0;
}