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 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.
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.
2 na banananobano 6 foobar foo 9 foobarfoo barfoobarfoobarfoobarfoobarfoo
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|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Resource:||the problem was phrased and test data was supplied by Mr. Maciej 'hawk' Jarzębski|
AC in 0.06s using string.find and iostream :)
used none of kmp or Z algo just used str.find from stl libraries, got AC in one go . BUt need to study these algo as it took 2.81s that's quiet much of time .
AC with rabin karp in 0.18 :D
This is by far the worst worded problem I have solved.
how many test cases ?
nice for z algorithm...!
I want to learn other methods too...
STL "find()"s a way through in 0.51s
Program does not input no of test cases initially??
It's Calles the *Zee Algorithm* :D