String occurences - MarisaOJ: Marisa Online Judge

String occurences - MarisaOJ: Marisa Online Judge

You are given 2 string

S

$S$ and

T

$T$ . Count the number of occurrences of

T

$T$ in

S

$S$ (i.e. how many substrings of

S

$S$ equal to

T

$T$ ). ### Input - First line contains string

S

$S$ . - Second line contains string

C

$C$ . ### Output - The number of occurrences of

T

$T$ in

S

$S$ . ### Constraints -

1 \leq | T | \leq | S | \leq 1000

$1 \le |T| \le |S| \le 1000$ . ### Example Input:

a s a s a a s a

$asasa asa$

Output:

2

$2$

String
	Length
	Word Count
	lowercase
	Vowel
	Digit sum
	Strong password
	Letter frequencies
	Palindrome string
	Palindrome substring
	Caesar cipher
	String occurences
	Sum
	String normalization
	Run-length encoding
	Expression

Topic

Basic

Rating

800

Solution (0)

Solution