NAJPF - Pattern Find


Your task is so simple given a string and a pattern. You find the pattern on the given string. If found print how many time found the pattern and their index. Otherwise print ‘Not Found’

Input:          

The input   line consists of a number T (1 ≤ T ≤ 50) test cases.

For each case given two string number  A,B. the string and the pattern  1 ≤|A|, |B| ≤10^6

All character will be lower case Latin character.  And |  | is the length of string.

Output:

For each case print the number  (found pattern from the given string) next line there position And Otherwise print 'Not Found' without quota.
There will a blank line between two cases.

Sample:

Input

Output

3
ababab ab
aaaaa bbb
aafafaasf aaf

3
1 3 5

Not Found

1
1

 

 

Hints:

Here all index is 1 base.


hide comments
kdjonty31: 2020-06-30 11:30:54

AC in one go! 0.04 secs using KMP and global declaration of strings.

rehank478: 2020-06-28 19:14:26

AC in one go using Rabin Karp

fawad: 2020-06-23 08:12:45

Learned both rabin karp and kmp :)

arpit_pro: 2020-05-30 20:06:46

weak test cases I later came to know that my code was wrong but it passed

nb_3018: 2020-05-28 18:58:36

I'm getting TLE inspite of using the KMP algorithm (coded in Java), can't figure out why ...

lovlesh_007: 2020-05-25 09:33:52

Using string find function , I get the Time complexity of 0.02 seconds.

asifalim: 2020-05-09 13:49:20

using kmp O(n+m) 0.38 sec

medhruv7: 2020-05-01 14:30:01

rabin karp AC one go :)

riyansh16_: 2020-04-14 21:11:43

can be done by brute force with a time complexity of O(n)

Last edit: 2020-04-14 21:13:25
alphatheta: 2020-04-05 23:48:27

AC with Polynomial Hashing: 0.24s


Added by:Najmuzzaman
Date:2014-10-23
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU