https://mirror.codeforces.com/contest/1796/problem/B
This question I tried using LCM. I would make dp table for LCM and for finding LCM, I will traverse the table and wherever the elements in string a and b are same I will add that to my answer string else I will add '*'. Then I will remove all the consecutive '*' and check if number of asterisk are less than or equal to letters then I will print "YES" else print "NO".
When I am running this code I am getting "wrong answer The jury has the answer but the participant doesn't (test case 1333)". Can anyone tell what is wrong in my code and when do we get this error?
My submission link is: https://mirror.codeforces.com/contest/1796/submission/195562144
It means that you printed NO but the actual answer is YES
A counter example:
The answer can be
But your solution outputs
NO.In fact, you only need to consider of 3 cases: "*a", "a*" and "*ab*". All asterisk-minor templates can be represented by one of them.