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 |
3 |
Hints:
hide comments
madhur4127:
2018-07-24 10:04:16
brute force worked in 0.02s, Weak test cases! |
|
forte11:
2018-05-18 05:25:44
I use hash table!!! |
|
rohit9934:
2018-01-20 16:31:06
simple bruteforce works in 0.9 sec. |
|
coder271:
2018-01-16 07:02:02
learn kmp algo from geeksforgeeks |
|
Rajivteja:
2017-11-09 13:57:25
Weak test cases.
|
|
dream_kid:
2017-08-13 15:59:59
kmp i love it |
|
arikpamnani:
2017-07-23 13:42:42
AC using KMP!
|
|
aditya930:
2017-02-03 17:17:36
Use KMP algo!!
|
|
divya_28:
2017-01-27 06:28:26
AC using KMP !! |
|
vengatesh15:
2017-01-26 14:59:57
Kmp Algorithm.... |
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 |