1003 F. Abbreviation Problem Description:
1003 F. Abbreviation Problem Description:: a task in repo2rlenv-scaler (Harbor dataset). Let's denote a segment of words w i..j as a sequence of words w i, w {i + 1}, ..., w j. Two segments of words w i 1 .. j 1 and w i 2 .. j 2 are considered equal if j 1 - i 1 = j 2 - i 2, j 1 ≥ i 1, j 2 ≥ i 2…
The task
Let's denote a segment of words w[i..j] as a sequence of words w_i, w_{i + 1}, ..., w_j. Two segments of words w[i_1 .. j_1] and w[i_2 .. j_2] are considered equal if j_1 - i_1 = j_2 - i_2, j_1 ≥ i_1, j_2 ≥ i_2, and for every t ∈ [0, j_1 - i_1] w_{i_1 + t} = w_{i_2 + t}. For example, for the text "to be or not to be"…
Part of FineEnvs/repo2rlenv-scaler.