OJ Board

Could anyone please tell me how to solve this problem?

Thx for help, I got ac:). I did have a misunderstanding of this problem.

Chirag Chheda wrote:Consider the case 1+110 == 1 + 10.
The output for the above case should be ambiguous.
Hope it helps.

Sorry, I don't quite understand. Could you please explain it in details? Thanks very much..

I think each time the polygon increase, Bi - Ai is a constant. I suggest B0 = x * y. B0 is the initial area of the retangle. So I get this equation: (x + 2 * n) * (y + 2 * n) - (B0 - A0) = An n is the length of step. so I enumerate each x (1 <= x <= sqrt(B0)) and solve the equation with binary searc...

My basic idea about this problem is that, given n strings(the weapon's code) and judge if one string is composite by other string.
I use dp to solve this problem but I got WA...
I don't know whether I have a misunderstanding on this problem...Plz help me, thx in advance

Thx to your testdata, I finally got AC. :D Here's my output on your testdata: No No No No No No No Yes No No No Yes No No No Yes Yes No No No No Yes Yes No No No No No No No No No No No Yes No No Yes Yes No No No No No No No No Yes No Yes Yes No No No No No Yes No No Yes No No No No No No No No No Y...