Loading repovive.com/contests/2/problems/B
You are given an integer and a string of length consisting only of characters 0, 2, and 6.
You want to partition the positions into exactly pairs.
That is, you must choose pairs of indices such that:
For each chosen pair , the two-character string must be a substring of 2026, meaning it must be equal to one of:
200226Determine whether it is possible.
0, 2, 6
where is either Yes or No.