ADAMATCH - Ada and Nucleobase


Ada the Ladybug is helping her friend who is biologist. He examines DNA. Actually he has a long DNA of one bug, consisting of adenine, cytosine, guanine and thymine and he wants to know whether another bug might be relative to first bug. A bug is relative to another bug if his his DNA has very low Hamming Distance with some substring of the first bug.

Your job is to find the lowest hamming distance between second DNA and any substring of first DNA.

Input

Input contains only two lines: first DNA (s) and second DNA (r).

It is true that 0 < |r| ≤ |s| ≤ 5*105

|s| means leangth of string s.

All strings contains only A, C, T, and G .

Output

Print minimal Hamming Distance (the number of mismatched nucleobases) of any substring of s and r (the substring MUST have length |r|)

Example Inputs

ACTGACTGACTG
ACCG
AAAAAACCA
AAACA
ACGC
GGG
ACTTTG
TTTGA
ACTGACTGACTG
ACTG

Example Output

1
1
2
3
0

Inputs explanation

ACTGACTGACTG
AAAAAACCA
ACGC
ACTTTG
ACTGACTGACTG 


hide comments
morass: 2017-02-10 03:37:58

@Min_25: Sorry for that :'( (sadly I have low "overlook" over SPOJ database problems )

Min_25: 2017-02-10 03:30:34

Almost the same problem as http://www.spoj.com/problems/MAXMATCH/.

morass: 2017-02-10 01:35:12

@[Rampage] Blue.Mary: Thank you for first-solving (==> testing). Have nice day!


Added by:Morass
Date:2017-02-09
Time limit:6.5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU