313B - Ilya and Queries.cpp

/*
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.

Examples
inputCopy
......
4
3 4
2 3
1 6
2 6
outputCopy
1
1
5
4
inputCopy
#..###
5
1 3
5 6
1 5
3 6
3 4
outputCopy
1
1
2
2
0

*/






#include<bits/stdc++.h>
using namespace std;
 
void solve() {
	string s;
	cin >> s;
	
	int m;
	cin >> m;
	
	vector <int> v(s.length(), 0);
	
	for (int i = 0; i < s.length(); i++) {
		if (s[i] == s[i + 1]) v[i + 1] = v[i] + 1;
		else v[i + 1] = v[i];
	}
	
	while (m--) {
		int l, r;
		cin >> l >> r;
		
		cout << v[r - 1] - v[l - 1] << "\n";
	}
	
}
 
int main(){
    ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t = 1;
	//cin >> t;
	
	while (t--)  solve();
	
    return 0;
}