Description: Given a string S [1 .. n] and an integer T, now need to find the length of the string S is not less than T, a sub-string, making it in the original string does not overlap occurs more frequently than to seek the number of times. Input The first line: an integer T (T> 1) second line: a string S, and contains only lowercase letters, the string length does not exceed 10000 Output an integer. Appears most representative of the number of times, if the solution does not meet the conditions, the output 0
To Search:
File list (Check if you may need any files):
longerstr\01.cpp
.........\01.dsp
.........\01.dsw
.........\01.ncb
.........\01.opt
.........\01.plg
.........\0110.asp
.........\02.cpp
.........\02.dsp
.........\02.dsw
.........\02.ncb
.........\02.opt
.........\02.plg
.........\Debug\01.exe
.........\.....\01.obj
.........\.....\01.pdb
.........\.....\02.exe
.........\.....\02.obj
.........\.....\02.pdb
.........\.....\sbb.exe
.........\.....\sbb.pdb
.........\.....\vc60.pdb
.........\sbb.dsp
.........\sbb.dsw
.........\sbb.ncb
.........\sbb.opt
.........\sbb.plg
.........\Debug
longerstr
Download