B. Ilya and Queries

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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).

Output

Print m integers — the answers to the queries in the order in which they are given in the input.

Sample test(s)

input

......
4
3 4
2 3
1 6
2 6

output

1
1
5
4

input

#..###
5
1 3
5 6
1 5
3 6
3 4

output

1
1
2
2
0

解题说明：此题是求一个字符串中一段指定位置内连续出现的相同的字符有多少个，最简单的的想法就是针对每一次查找遍历相应位置输出结果，但是在字符串较长时肯定会超时。为此，我们应该在输入字符串后就进行处理，用一个和字符串长度相同的int数组保存到字符串这个位置连续出现的字符数有多少，这一点和动态规划的思想类似。最后查询时只需要用末尾的int值减去开头的int值即可，这个增加的值就是在这段区间内连续出现的字符数目。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;


int main()
{
	char s[100009];
	int a[100009]={0},i,j,n,x,y,l;
	scanf("%s",s);
	l=strlen(s);
	for(i=1;i<l;i++)
	{
		a[i]+=a[i-1];
		if(s[i]==s[i-1])
		{
			a[i]++;
		}
	}
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d%d",&x,&y);
		printf("%d\n",a[y-1]-a[x-1]);
	}
	return 0;
}