#include<bits/stdc++.h>
using namespace std;
string str, s;
int N, M, K, A, B;
int main()
{
cin >> N >> str;
while (N--)
{
cin >> M;
if (M == 1)
{
cin >> s;
str += s;
}
else if (M == 2)
{
cin >> A >> B;
str = str.substr(A, B);
}
else if (M == 3)
{
cin >> K >> s;
str = str.substr(0, K) + s + str.substr(K);
}
else
{
cin >> s;
auto it = str.find(s);
if (it == str.npos)cout << -1 << endl;
else cout << it << endl;
continue;
}
cout << str << endl;
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
string s, ans;
char ch;
int main()
{
getline(cin, ans);
getline(cin, s);
for (auto& i : ans)
if (i >= 'a' && i <= 'z')
i ^= 32;
for (auto& i : s)
if (i >= 'a' && i <= 'z')
i ^= 32;
ans = " " + ans + " ";
s = " " + s + " ";
if (s.find(ans) == s.npos)
cout << "-1";
else
{
int sum = 0;
auto pos = s.find(ans);
while (pos != s.npos)
{
sum++;
pos = s.find(ans, pos + 1);
}
cout << sum << " " << (int)s.find(ans);
}
return 0;
}
删除对应子串比如改变子串
#include<bits/stdc++.h>
using namespace std;
string str;
int sum, N, falg;
int main()
{
cin >> N >> str;
auto pos = str.find("VK");
if (pos == str.npos)
cout << (str.find("KK") != str.npos || str.find("VV") != str.npos) << endl;
else
{
for (int i = 0; i != str.size(); i++)
{
if (str[i] == 'V' && str[i + 1] == 'K')
{
str[i] = str[i + 1] = 'v';
sum++;
}
}
cout << sum + (str.find("KK") != str.npos || str.find("VV") != str.npos) << endl;
}
return 0;
}
P1553 数字反转(升级版)
#include<bits/stdc++.h>
using namespace std;
string s1, s2;
char ch;
bool is_BFH, is_XS, is_FH;
int main()
{
while (cin >> ch)
{
if (ch == '.') { is_XS = true; continue; }
if (ch == '%'){is_BFH = true; continue;}
if (ch == '/'){is_FH = true; continue;}
if (!is_XS && !is_FH)s1 += ch;
else s2 += ch;
}
reverse(s1.begin(), s1.end());
if(s1.size() != 1)
while (s1[0] == '0')s1.erase(0, 1);
if(s2.size() != 1)
while (s2[0] == '0')s2.erase(0, 1);
reverse(s2.begin(), s2.end());
if(s2.size() != 1)
while (s2[0] == '0')s2.erase(0, 1);
if (is_XS)
cout << s1 << '.' << s2;
else if (is_BFH)
cout << s1 << '%';
else if (is_FH)
cout << s1 << '/' << s2;
else
cout << s1;
return 0;
}