OJ Board

I have just tried this 0.0%-rated problem and got accepted in a few trials.
The key is high precision - simply using double or long double may not be sufficient.
Try to "magnify" the input numbers.

i used IDA* and solved in 0.000sec.

if n<=20 try bfs from both the start and goal
the bfs tree grown from the start will meet the one grown from the goal at some node x
then start ~> x ~> goal is the path

I got WA every time..... plz help me ><
plz ><

[cpp]#include <iostream>
#include <math.h>
#include <string>

long long i,j,k,l,tmp,a,digits[100];
string strg;

int main() {
while(cin >> strg,strg!="0") {
j=2;
for(i=0,k=strg.length()-1;i<strg.length();++i) {
digits =strg[k-i]-48;
if(digits >j ...

thx for ur reply.

Another question:
You have ``escaped" whenever you reach a square on an outside edge of the grid.
squares on outside edge are those marked with X or those with A?? (plz refer to the sample input)

XXXXXX
XOOAOX
XA..OX
XOO.AX
XOAAOX
XXXXXX

Do I need to walk UNTIL i reach a blocked location? or I can stop anywhere and continue to the next direction?