Hey Codeforces,

I tried to write the editorial of the problem CLONEME.

The blog post is here.

You could also check out my other blogs on the website.

I would really appreciate any criticism and feedback from you guys!!

Thanks in advance!

As the title is pretty clear, I want to solve this problem DISTX but I am unable to design any algorithm within time limit. The best I can think of is an n² approach.

Can anyone please help me solve this problem?

I was trying to submit the solution to the problem, but anyhow it is giving me wrong answer on the first test itself which is the same as in the problem.

The checker log says,

Can't find file C:\Contesters\Work\invoker-prod\work\codeforces2\05cb3343ceb9f6e3104ff51ff87bc7fb\check-8a86c82f5f45567b8e70d6a660570c0b\run\output.txt.

How to get around this?

My code is here: Code and the problem statement is here

I was trying to solve this problem QTDIVIDE on spoj and I think it is a DP problem but couldn't solve it. Can someone help me out and point me into the right direction?

Thanks in advance!