siddhant4583agarwal's blog

By siddhant4583agarwal, history, 21 month(s) ago, In English

https://codeforces.me/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://codeforces.me/contest/1796/submission/195562144

  • Vote: I like it
  • 0
  • Vote: I do not like it

| Write comment?
»
21 month(s) ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

It means that you printed NO but the actual answer is YES

»
21 month(s) ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

A counter example:

1
daebfcguvw
haibjckuvx

The answer can be

YES
*uv*

But your solution outputs NO.

»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

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.