baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 07:31:59 +00:00
Code Releases Activity

P1308 [NOIP2011 普及组] 统计单词数

Browse Source 
R55232709
This commit is contained in:
Baoshuo Ren 2021-08-07 19:11:15 +08:00 committed by Baoshuo Ren
parent 322a331727
commit 42f16ec07f
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 14 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

45
Luogu/problem/P1308/P1308.cpp
View File

@ -1,41 +1,22 @@
// https://www.luogu.com.cn/record/38659937
#include <bits/stdc++.h> #include <bits/stdc++.h>
using namespace std; using namespace std;
int cnt, now;
string w, s;
int main() { int main() {
int cnt = 0, t = 0; getline(cin, w);
string word, p; getline(cin, s);
w = ' ' + w + ' ';
getline(cin, word); s = ' ' + s + ' ';
getline(cin, p); transform(w.begin(), w.end(), w.begin(), ::tolower);
transform(s.begin(), s.end(), s.begin(), ::tolower);
for (int i = 0; i < word.size(); i++) { if (s.find(w) == string::npos) {
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; cout << -1 << endl;
return 0; } else {
while ((now = s.find(w, now)) != string::npos) cnt++, now++;
cout << cnt << ' ' << s.find(w) << endl;
} }
while (t != string::npos) {
cnt++;
t = p.find(word, t + 1);
}
cout << --cnt << ' ' << p.find(word) << endl;
return 0; return 0;
} }