missisippi 5 i s a is missisippi
4 3 0 2 1 Let $S[l:r]$ denote the substring of $S$ from the $l$\-th character through the $r$\-th character. * For the 1st query, four substrings of $S$ equal `i`: $S[2:2], S[5:5], S[7:7], S[10:10]$. * For the 2nd query, three substrings of $S$ equal `s`: $S[3:3], S[4:4], S[6:6]$. * For the 3rd query, no substrings of $S$ match `a`. * For the 4th query, two substrings of $S$ equal `is`: $S[2:3], S[5:6]$. * For the 5th query, one substring of $S$ equals `missisippi`: $S[1:10]$.
aaaaaa 6 a aa aaa aaaa aaaaa aaaaaa
6 5 4 3 2 1
{
"problem": {
"name": "Count Substring Query",
"description": {
"content": "You are given a string $S$ consisting of lowercase English letters. You are also given $Q$ queries to process sequentially. The $i$\\-th query is described as follows: * A string $T_i$ consisting of",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 3000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc362_g"
},
"statements": [
{
"statement_type": "Markdown",
"content": "You are given a string $S$ consisting of lowercase English letters.\nYou are also given $Q$ queries to process sequentially. The $i$\\-th query is described as follows:\n\n* A string $T_i$ consisting of...",
"is_translate": false,
"language": "English"
}
]
}