#PU1323. USACO 2023 US Open Contest, Bronze — Problem 1. FEB
USACO 2023 US Open Contest, Bronze — Problem 1. FEB
USACO 2023 US Open Contest, Bronze — Problem 1. FEB
题目描述
Bessie and Elsie are plotting to overthrow Farmer John at last! They plan it out over () text messages. Their conversation can be represented by a string of length where is either or , meaning the th message was sent by Bessie or Elsie, respectively. However, Farmer John hears of the plan and attempts to intercept their conversation. Thus, some letters of are , meaning Farmer John obfuscated the message and the sender is unknown. The excitement level of a non-obfuscated conversation is the number of times a cow double-sends - that is, the number of occurrences of substring or in . You want to find the excitement level of the original message, but you don’t know which of Farmer John’s messages were actually Bessie’s / Elsie’s. Over all possibilities, output all possible excitement levels of .
输入格式
The first line will consist of one integer . The next line contains .
输出格式
First output , the number of distinct excitement levels possible. On the next lines, output the excitement levels, in increasing order.
数据范围
Inputs 4-8: Inputs 9-20: No additional Problem credits: William Yue and Claire Zhang
样例
样例 1
4
BEEF
2
1
2
样例 2
9
FEBFEBFEB
2
2
3
样例 3
10
BFFFFFEBFE
3
2
4
6