OJ Board

YES! off course its says in the problem

Brother Arif, standing on one of these cells, can move to one of the four adjacent cells just once or he may not move at all.

I was only checking the 4 adjacent blocks but not his current position
there are no 4 blocks to be cheked there are 5 ..
Alot ...

thanx to both of u for replying
and durjay well I am happy ,ur code got accepted ..but no my program dont have that (0,0) problem believe me , i already saw that one comming in my algorithm if Arif is at any corner his 2 of 4 posibilities of escaping become false , i m checking if a-1,a+1 ,b-1 or b ...

hi ,
i m not much good at programming (specially pointers create problems in my head ) so i am having a bit problems in understanding your code I cant specify the problem..
but i can give an advice .. :D
well in the programming Challenges Book by Fred B. Schneider it says something about pointers ...

hi,
code removed after being accepted thanks all . its been fun ok i m going to try another one !