Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

Range Question

Revision en2, by gXa, 2019-12-12 11:46:48

A list of strings of lowercase English alphabets is given.

It is followed by a list of operations, where each operation is denoted by

(a, b, c): append character c to all elements in the range a to b

c can be of three types (#,$,%), and if c is already appended to an element, adding again won't affect. We need to find minimum number of operations required actually to get the final output. Note: All operations must be done in the given order. We can decide to skip it or not. Given list of strings: a, b, c, d Operations: 1. 1 2$

2. 1 4 \$

Output: 1

It is because 2 would bring the final output itself.

#### History

Revisions

Rev. Lang. By When Δ Comment
en2 gXa 2019-12-12 11:46:48 24
en1 gXa 2019-12-12 11:43:05 652 Initial revision (published)