OJ Board

Thank you, helloneo! I will try!

I have no idea to solve this problem.
Would someone give me a hint?

I'm sorry that I misunderstood your algorithm. It's not same to mine. and I think you have misread problem statement.
Problem statement says, "your sister will lose if and only if she loses all her pawns" and "Can U Ensure your Win making not more than n legal (or illegal?) moves".
This means that ...

My algorithm is maybe same to you.
However, your program allow you to move your knight n+1 times.
It should be only n times.

My answer is no.
I think you can find your mistake with that input.
(Hint: There are 3 'p's in the input, but you can move your knight at most 2 times...)

try folloing input

Hello.
I cannot understand how to change to matching problem
Would someone show me an example?