Robot lifting heavy loads pascal

Look up "Sokoban" on the Internet

var ch:string;

i:integer;

s:array [(x,y)] of -1000..10000;

beginreadln(ch);

for i:=1 to 255 do

case ch[i] of

n':s[y]:=s[y]+1;

s':s[y]:=s[y]-1;

w':s[x]:=s[x]-1;

e':s[x]:=s[x]+1;

end;writeln(s[x],' ',s[y]);

end.Save a blank one, then close it, open the saved file with Notepad, and copy it directly. Format yourself. Give me the best. All right?

If you're not using turbo pascal, change the first line of 'string' to 'packed array [ of char'。

How is it so simple......

Our question is harder than yours.

Strings are of unlimited length.

And when walking, it rotates at the angle of the robot.

That is, at the beginning (0,0) after turning eastward.

His direction was not to face north.

Rather, it faces the east.

My topic is as follows.

The robot walks strictly according to the instructions, and because it is a primitive device, it can only issue the following 4 commands: g: go straight forward one unit; l：

Turn left and move one unit forward; r: Turn right and move one unit forward; s: Stop moving, and turn off the robot.

The bot is case-agnostic to instructions, but does not do anything with any other instructions.

Now the robot opens the robot to receive the command and places it in the (0,0) coordinates; The default direction is north (n), ask after receiving a series of commands, the coordinates of the robot are **? Orientation**? (Directions, southeast, northwest, and ESWN are denoted respectively).

Input format: string (a string of any length).

Output format] x,y),f (the stop coordinates of the robot, f represents the direction the robot is facing at this time, and there is a space between the coordinates and the direction).

Input and output samples].

Input: grlrrlrrs

Output: (2,0) W

Build two arrays a,b:[.]'a'..z'動組行] of integer then for i:=1 to length(a1) do Shen Cong a1 is the name of the first robot.

inc(a[a1[i]])

B1 was treated with the same group uproar method;

for x:='a' to 'z' do

if (a[x]>0) and (b[x]>0) then c1:=c1+i;

Output. That's it, the program thinks for itself, I won't play.