If by "hacked" you mean a solution will fail on a perverse case, this is not an issue. It's hard enough to pass average cases.

Closing.

I have tried it on my computer and it works, but I don't know why it doesn't work on the OJ.

Lua translation!

like this:

++
||    2 times
++

+-+
| |   4 times
+-+

longer pieces are not valid because they would contain some separations.

EDIT: sidenote: I see you didn't solve the easy version yet. If you plan to solve the present one first, don't post the same solution in the easy version. Prune out the irrelevant parts of the code first, thx.

What will happen for the shape below?

+-++-+
| || |
+-++-+
| || |
+-++-+

It can be spilt to four

+-+
| |
+-+ 's

centainly. But which one should

++
||
++
||
++ 

be regarded as, one

++
||
||
||
++

or two

++
||
++ 's

?

I'd love to know why it works.

I thought your code is similar to mine.

There are only 3 languages for this kata, either wait for someone else to add C++ or translate it yourself. Not a kata issue.

Where c++ is not supported for this kata?

I have to say my code is ugly.

Same idea with mine.