Sphere Online Judge

SPOJ Problem Set (classical)

32. A Needle in the Haystack

Problem code: NHAY


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.

Input

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 the memory available to your program, so do not make any assumptions - instead, read the length and allocate memory as needed. The haystack is not limited in size, which implies that your program should not read the whole haystack at once. The KMP algorithm is stream-based, i.e. it processes the haystack character by character, so this is not a problem.

The test cases come one after another, each occupying three lines, with no additional space or line breaks in between.

Output

For each test case your program should output all positions of the needle's occurences within the haystack. If a match is found, the output should contain the position of the first character of the match. Characters in the haystack are numbered starting with zero.

For a given test case, the positions output should be sorted in ascending order, and each of these should be printed in a separate line. For two different test cases, the positions should be separated by an empty line.

Example

Sample input:
2 na banananobano 6 foobar foo 9 foobarfoo barfoobarfoobarfoobarfoobarfoo

Sample output:

2
4

3
9
15
21

Note the double empty line in the output, which means that no match was found for the second test case.

Warning: large Input/Output data, be careful with certain languages
Added by:Micha≥ Ma≥afiejski
Date:2004-06-03
Time limit:5s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All
Resource:the problem was phrased and test data was supplied by Mr. Maciej 'hawk' JarzÍbski

hide comments
2014-09-03 07:04:35 Eddy Cael
I can't understand... My solution with KMP runs in 1.20. But my other solution using string.find() runs in only 0.63 ... C++ library is more powerful? o.O
2014-08-31 13:11:31 Himanshu Jaju
AC with rabin-karp :)
2014-08-14 11:18:38 matici
atlar uzayli
2014-07-28 00:31:08 arjun
STL :)
2014-06-20 15:44:56 ansh7jan
How to check the end of input...Please help me
2014-06-13 23:04:05 ashish jaiswal
100th consecutive AC in first attempt. Thank to god :)))
2014-06-04 12:59:00 hack_a
STL _/\_ MAKES IT EASY..:)
2014-06-03 10:03:01 sai spoorthy
i have done this by generating permutations for the word given and getting correct answer but it is giving me run time error(NZEC)
somebody please help me i am new to SPOJ
2014-06-02 08:06:33 Barney
http://ideone.com/CO07At
can anyone help me with this code.
GETTING WA on spoj

Last edit: 2014-06-02 20:33:08
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.