Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.
You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m queries. Each query is described by a pair of integers li, ri (1 ≤ li < ri ≤ n). The answer to the query li, ri is the number of such integers i (li ≤ i < ri), that si = si + 1.
Ilya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.
獅子伊利亞想幫助他所有的朋友通過考試。 他們需要解決以下問題才能通過 IT 考試。
你有字符串 s = s1s2...sn(n 是字符串的長度),只包含字符“。” 和 "#" 和 m 個查詢。 每個查詢由一對整數 li, ri (1 ≤ li < ri ≤ n) 描述。 查詢 li, ri 的答案是此類整數 i (li ≤ i < ri) 的數量,即 si = si + 1。
獅子伊利亞想幫助他的朋友,但有沒有人可以幫助他? 幫助伊利亞,解決問題。
The first line contains string s of length n (2 ≤ n ≤ 105). It is guaranteed that the given string only consists of characters "." and "#".
The next line contains integer m (1 ≤ m ≤ 105) — the number of queries. Each of the next m lines contains the description of the corresponding query. The i-th line contains integers li, ri (1 ≤ li < ri ≤ n).
第一行包含長度為 n (2 ≤ n ≤ 105) 的字符串 s。 保證給定的字符串只包含字符“.”。 和 ”#”。
下一行包含整數 m (1 ≤ m ≤ 105) — 查詢數。 接下來的 m 行中的每一行都包含相應查詢的描述。 第 i 行包含整數 li, ri (1 ≤ li < ri ≤ n)。
Print m integers — the answers to the queries in the order in which they are given in the input.
打印 m 個整數 — 按照輸入中給出的順序對查詢的答案。
...... 4 3 4 2 3 1 6 2 6
1 1 5 4
#..### 5 1 3 5 6 1 5 3 6 3 4
1 1 2 2 0
ID | User | Problem | Subject | Hit | Post Date |
沒有發現任何「解題報告」 |