omg.

i did so much writing today, that my hand is gonna fall-off!

and still, the BEST possible and most simple algo i found is this:

Code: Select all

```
if (a[j]=='E') { niz[y+1][x++]='X'; }
if (a[j]=='N') { niz[y--][x]='X'; }
if (a[j]=='W') { niz[y][--x]='X'; }
if (a[j]=='S') { niz[++y][x-1]='X'; }
```

is it correct?! it gives me all the right answers, even for MF sample input (1, 3 6, SSSEEENNNWWW.)

i really don't get it.

am i so desperate that i can't solve one problem?! which even isn't so complicated?!

i solved 88 problems, and many of them were hard, or confusing, but this one is becoming irritating...

seriously.

anyway, i appreciate any help i can get, and i know i won't stop untill i get ACC, so.. HEEEELP ME! haha...

one more thing, MF, you said:

"....and the border is always a "box" whose right side is the segment ((x,y) - (x,y-1)).... "

i don't get it - what exactly is the 'segment' ? by "box" i guess you mean one character place in my 2D array (char[32][32]), but what is "segment ((x,y) - (x,y-1)) " ?

cheers,

i gotta go get some sleep,

**dootzky**