#### Topic: Comparing of two lines with even and odd swaps

There are two lines. We consider that they are equal in a case if there is a dial-up of operations on transformation of one of a line in another. Accessible operations of transformation it is swap by places of odd characters in line. The second operation swap by places of even characters. How to solve? I have a decision, but probably will be correct it in the end to tell. As though you solved?

#### Re: Comparing of two lines with even and odd swaps

Hello, Gattaka, you wrote: G> There are two lines. We consider that they are equal in a case if there is a dial-up of operations on transformation of one of a line in another. Accessible operations of transformation it is swap by places of odd characters in line. The second operation swap by places of even characters. G> how to solve? I have a decision, but probably will be correct it in the end to tell. As though you solved? 1) the line is superposition of even and odd lines 2) lines are equal, if their even and odd lines 3 are mutually equal) equality of lines to consider as a) to count amounts of different characters in lines b) to compare these amounts. If they are equal, lines equal Not?

#### Re: Comparing of two lines with even and odd swaps

Hello, Gattaka, you wrote: G> There are two lines. We consider that they are equal in a case if there is a dial-up of operations on transformation of one of a line in another. Accessible operations of transformation it is swap by places of odd characters in line. The second operation swap by places of even characters. G> how to solve? I have a decision, but probably will be correct it in the end to tell. As though you solved? Well, apparently, if at lines an identical dial-up even characters and an identical dial-up of odd characters ("identical" - means that there are same characters in the same amount) single line to another to result  it is possible...

#### Re: Comparing of two lines with even and odd swaps

Hello, Pzz, you wrote: Pzz> Hello, Gattaka, you wrote: G>> There are two lines. We consider that they are equal in a case if there is a dial-up of operations on transformation of one of a line in another. Accessible operations of transformation it is swap by places of odd characters in line. The second operation swap by places of even characters. G>> how to solve? I have a decision, but probably will be correct it in the end to tell. As though you solved? Pzz> well, apparently, if at lines an identical dial-up even characters and an identical dial-up of odd characters ("identical" - means that there are same characters in the same amount) single line to another to result  it is possible... Precisely? There is a floor-mat. The proof?

#### Re: Comparing of two lines with even and odd swaps

Hello, Gattaka, you wrote: Pzz>> Well, apparently, if at lines an identical dial-up even characters and an identical dial-up of odd characters ("identical" - means that there are same characters in the same amount) single line to another to result  it is possible... G> it is exact? There is a floor-mat. The proof? Well, the proof  I will not result, but as far as I understand if it is authorized to rearrange mutually any two characters sequence of such operations it is possible to sort out all combinations.