牛客算法周周练18救救企鹅

#include <string>
#include <iostream>

using namespace std;

int main()
{
    
    

    string s, A, B;
    cin >> s >> A >> B;
    int pos = s.find(A);

    while (pos != -1)
    {
    
    
        s.replace(pos, A.size(), B);
        pos = s.find(A);
    }

    cout << s << endl;
    return 0;
}