显示原始代码
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1000010;
char s[N];
int b[N];
int tag = 0;
char a[10] = { 's', 'h', 'e', 'n', 'c', 'h', 'u', 'a', 'n' };
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
if (s[i] == 's') {
int j = 0;
while (j < n - i & j < 9) {
if (s[i + j] == a[j]) {
j++;
} else {
continue;
}
}
if (j == 9) {
b[tag] = i;
tag++;
}
}
}
printf("%d\n", tag);
if (tag == 0 & n > 9) {
tag = tag + 1;
}
for (int i = 0; i < tag; i++) printf("%d ", b[i]);
}