63. 统计单词数

题目链接

点此跳转

代码

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>

#define LL long long
#define mem(a, b) memset(a, b, sizeof a)
#define lowbit(x) (-x&x)
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define endl '\n'
#define rev(x) reverse(x.begin(), x.end())
#define INF 0x3f3f3f3f

using namespace std;

void solve() {
	int scnt = 0, len = 0, start = -1, cnt = 0;
	string s, t;
	
	cin >> t;
	transform(t.begin(), t.end(), t.begin(), ::tolower);
	while (cin >> s) {
		if (s.size() != t.size()) continue;
		transform(s.begin(), s.end(), s.begin(), ::tolower);
		bool f = true;
		for (int i = 0; i < s.size(); i ++ ) {
			if (t[i] != s[i]) f = false;
		}
		if (f) {
			if (start == -1) start = len;
			cnt ++ ;
		}
		len += s.size() + 1;
	}
	
	if (start != -1) cout << cnt << " " << start << endl;
	else cout << start << endl;
}

int main() {
	IOS;
	
	solve();
	
	return 0;
}