consolidate z is delivered from an arrangement a by the accompanying principles: assuming ai=0, eliminate a letter from the start of x and attach it to the furthest limit of z; assuming ai=1, eliminate a letter from the start of y and attach it to the furthest limit of z.
Correct answer will be upvoted else downvoted. Computer science.
consolidate z is delivered from an arrangement a by the accompanying principles:
assuming
assuming ai=1, eliminate a letter from the start of y and attach it to the furthest limit of z.
Two consolidating successions an and b are unique in case there is some position I to such an extent that ai≠bi.
How about we call a string z tumultuous if for all I from 2 to |z| zi−1≠zi.
Let s[l,r] for some 1≤l≤r≤|s| be a substring of continuous letters of s, beginning from position l and finishing at position r comprehensive.
Let f(l1,r1,l2,r2) be the number of various consolidating successions of x[l1,r1] and y[l2,r2] that produce tumultuous unions. Note that main non-void substrings of x and y are thought of.
Compute ∑1≤l1≤r1≤|x|1≤l2≤r2≤|y|f(l1,r1,l2,r2). Output the appropriate response modulo 998244353.
Input
The main line contains a string x (1≤|x|≤1000).
The subsequent line contains a string y (1≤|y|≤1000).
The two strings comprise just of lowercase Latin letters.
Output
Print a solitary integer — the amount of f(l1,r1,l2,r2) over 1≤l1≤r1≤|x| and 1≤l2≤r2≤|y| modulo 998244353.
Step by step
Solved in 3 steps with 1 images
