interesting problem from Spoj

Правка en3, от Eddagdeg, 2019-02-06 22:55:57

Hello codeforces community! I'm stuck in this problem :you are given two strings s1 and s2 in one operation ou can reverse a substring in s2 what's the minimum number of operations needed to get identical strings.Opertations are made only on string 2? link Bonus:what's would be the answer if we can apply operations on both strings? any help! and Thanks!

Теги #strings

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский Eddagdeg 2019-02-07 13:37:25 30
en4 Английский Eddagdeg 2019-02-07 00:35:08 5 Tiny change: 'and Thanks!' -> 'and Thanks^__^'
en3 Английский Eddagdeg 2019-02-06 22:55:57 13
en2 Английский Eddagdeg 2019-02-06 14:41:02 1 Tiny change: 'tring 2?\n![link](htt' -> 'tring 2?\n[link](htt'
en1 Английский Eddagdeg 2019-02-06 14:40:12 428 Initial revision (published)