Amazing
One of the apparently intelligent tricks that enthousiastic psychologists persuade mice to perform is solving a maze. There is still some controversy as to the exact strategies employed by the mice when engaged in such a task, but it has been claimed that the animal keepers eavesdropping on conversations between the mice have heard them say things like "I have finally got Dr. Schmidt trained. Everytime I get through the maze he gives me food".| Amazing |
Thus when autonomous robots were first being built, it was decided that solving such mazes would be a good test of the 'intelligence' built into such machines by their designers. However, to their chagrin, the first contest was won by a robot that placed a sensor on the right-hand wall of the maze and sped through the maze maintaining contact with the right-hand wall at all times. This led to a change in the design of mazes, and also to the interest in the behaviour of such robots. To test this behaviour the mazes were modified to become closed boxes with internal walls. The robot was placed in the south west corner and set of pointing east. The robot then moved through the maze, keeping a wall on its right at all times. If it can not proceed, it will turn left until it can proceed. All turns are exact right angles. The robot stops when it returns to the starting square. The mazes were always set up so that the robot could move to at least one other square before returning. The researchers then determined how many squares were not visited and how many were visited one, twice, thrice and four times. A square is visited if a robot moves into and out of it. Thus for the following maze, the values (in order) are: 2, 3, 5, 1, 0.
Input
Input will consist of a series of maze descriptions. Each maze description will start with a line containing the size of the maze (b and w), This will be followed by b lines, each consisting of w characters, either '0' or '1'. Ones represent closed squares, zeroes represent open squares. Since the maze is enclosed, the outer wall is not specified. The file will be terminated by a line containing two zeroes.Output
Output will consist of a series of lines, one for each maze. Each line will consist of 5 integer values representing the desired values, each value right justified in a field of width 3.Sample Input
3 5 01010 01010 00000 0 0
Sample Output
2 3 5 1 0
Miguel A. Revilla
1998-03-10
simulation
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<iostream>
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define DBG 0
using namespace std;
int N,M,D;
int dir[4][2],ndir[4],rside[4][2];
char **vc;
void init(){
dir[0][0]=1,dir[1][1]=1,dir[2][0]=-1,dir[3][1]=-1;
rside[0][1]=-1,rside[1][0]=1,rside[2][1]=1,rside[3][0]=-1;
rep(i,4)ndir[i]=(i+1)%4;
}
bool isValid(int a,int b){return a>=0&&a<N&&b>=0&&b<M;}
void next(int &r,int &c){
//if(DBG)printf("r c %d %d\n",r,c);
int x=r+dir[D][0],y=c+dir[D][1];
//if(DBG)printf("x y %d %d\n",x,y);
if(isValid(x,y))
if(vc[x][y]=='0'){
r=x,c=y;
if(isValid(r+rside[D][0],c+rside[D][1])&&
vc[r+rside[D][0]][c+rside[D][1]]=='0'){
D=(D-1)>=0?D-1:3; //maintain against the wall
}
}
else D=ndir[D],next(r,c); //block
else D=ndir[D],next(r,c); //outside
}
void ans(){
D=1;
int steps[N][M];
int cnt[5];
memset(steps,0,sizeof(steps));
memset(cnt,0,sizeof(cnt));
int sr=N-1,sc=0,cr=N-1,cc=0;
steps[cr][cc]=1;
while(1){
if(DBG)printf("cur %d %d\n",cr,cc);
next(cr,cc);
if(cr==N-1&&cc==0)break;else steps[cr][cc]++;
}
rep(i,N)rep(j,M)if(steps[i][j]<5&&vc[i][j]=='0')cnt[steps[i][j]]++;
rep(i,5)printf("%3d",cnt[i]);
printf("\n");
}
int main(){
int a;
init();
while(scanf("%d%d",&N,&M)==2){
if(N==0&&M==0)break;
vc=(char **)malloc(N*sizeof(char *));
rep(i,N)vc[i]=(char *)malloc(M+1);
rep(i,N)scanf("%s",vc[i]);
ans();
}
}
such choice that you have faced since the start of execution of your program, and that you must choose one of n rules for expanding a given kind of phrase. Let the rules for that phrase be numbered from 
in the order of appearance above, and then choose rule number 
.
), Hearts ( 
), Diamonds ( 
) and Clubs ( 
). Within each suit there are 13 cards--Ace (A), 2-9, Ten (T), Jack (J), Queen (Q) and King (K).