0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-14 04:58:49 +00:00
OI-codes/problem/P1308/P1308.cpp

41 lines
761 B
C++
Raw Normal View History

2020-09-20 08:17:26 +00:00
// https://www.luogu.com.cn/record/38659937
#include <bits/stdc++.h>
using namespace std;
int main() {
int cnt = 0, t = 0;
string word, p;
getline(cin, word);
getline(cin, p);
for (int i = 0; i < word.size(); i++) {
if ('a' <= word[i] && word[i] <= 'z') {
word[i] -= 32;
}
}
for (int i = 0; i < p.size(); i++) {
if ('a' <= p[i] && p[i] <= 'z') {
p[i] -= 32;
}
}
word = ' ' + word + ' ';
p = ' ' + p + ' ';
if (p.find(word) == string::npos) {
cout << -1 << endl;
return 0;
}
while (t != string::npos) {
cnt++;
t = p.find(word, t + 1);
}
cout << --cnt << ' ' << p.find(word) << endl;
return 0;
}