1400题解

孙凝力

于 2024-10-07 12:24:58 发布

阅读量72

点赞数 2

文章标签：算法数据结构

本文链接：https://blog.csdn.net/sunningli7743/article/details/142738333

版权

#include <bits/stdc++.h>
using namespace std;
char w[25], s[1000010], c;
int main() {
	scanf("%s", w + 1);
	int la = strlen(w + 1);
	scanf("%c", &c);
	int l2 = 0;
	while (1) {
		scanf("%c", &c);
		if (c == '\n') {
			break;
		}
		s[++l2] = c;
	}
	for (int i = 1; i <= la; i++) {
		if (w[i] >= 'A' && w[i] <= 'Z') {
			w[i] = w[i] - 'A' + 'a';
		}
	}
	for (int i = 1; i <= l2; i++) {
		if (s[i] >= 'A' && s[i] <= 'Z') {
			s[i] = s[i] - 'A' + 'a';
		}
	}
	int p = 0;
	int cnt = 0;
	for (int i = 1; i <= l2; i++) {
		if (i + la - 1 >= l2) {
			break;
		}
		bool flag = 0;
		for (int j = 1; j <= la; j++) {
			if (s[i + j - 1] != w[j]) {
				flag = 1;
				break;
			}
		}
		if (i != 1 && s[i - 1] != ' ') {
			flag = 1;
		}
		if (i + la < l2 && s[i + la] != ' ') {
			flag = 1;
		}
		if (flag == 0) {
			cnt++;
			if (p == 0) {
				p = i;
			}
		}
	}
	if (cnt == 0) {
		cout << -1;
		return 0;
	}
	cout << cnt;
	cout << " " << p - 1;
	return 0;
}