SP32 NHAY - A Needle in the Haystack 题解

题意翻译

大意：

写一个程序在一个字符串中查找一个子字符串出现过的所有位置。

题目描述

Write a program that finds all occurences of a given pattern in a given input string. This is often referred to as finding a needle in a haystack.

The program has to detect all occurences of the needle in the haystack. It should take the needle and the haystack as input, and output the positions of each occurence, as shown below. The suggested implementation is the KMP algorithm, but this is not a requirement. However, a naive approach will probably exceed the time limit, whereas other algorithms are more complicated... The choice is yours.

输入输出格式

输入格式：

 

The input consists of a number of test cases. Each test case is composed of three lines, containing:

• the length of the needle,
• the needle itself,
• the haystack.

The length of the needle is only limited by