标签：panel 分享 round end iat i++ har sample app
InputThere will be one or more grids for robots to navigate. The data for each is in the following form. On the first line are three integers separated by blanks: the number of rows in the grid, the number of columns in the grid, and the number of the column in which the robot enters from the north. The possible entry columns are numbered starting with one at the left. Then come the rows of the direction instructions. Each grid will have at least one and at most 10 rows and columns of instructions. The lines of instructions contain only the characters N, S, E, or W with no blanks. The end of input is indicated by a row containing 0 0 0.
OutputFor each grid in the input there is one line of output. Either the robot follows a certain number of instructions and exits the grid on any one the four sides or else the robot follows the instructions on a certain number of locations once, and then the instructions on some number of locations repeatedly. The sample input below corresponds to the two grids above and illustrates the two forms of output. The word "step" is always immediately followed by "(s)" whether or not the number before it is 1.
Sample Input
3 6 5 NEESWE WWWESS SNWWWW 4 5 1 SESWE EESNW NWEEN EWSEN 0 0
Sample Output
10 step(s) to exit 3 step(s) before a loop of 8 step(s)
不知考什么的简单题
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <algorithm> 5 using namespace std; 6 struct lll 7 { 8 int x,y; 9 }b[110]; 10 int main() 11 { 12 char a[11][11]; 13 int lenx,leny,t,i,j; 14 while(cin>>leny>>lenx) 15 { 16 if(leny==0&&lenx==0) 17 break; 18 cin>>t; 19 for(i=1;i<=leny;i++) 20 for(j=1;j<=lenx;j++) 21 cin>>a[i][j]; 22 23 24 j=t; 25 i=1; 26 int flag=0; 27 int add=1; 28 b[add].x=j; 29 b[add].y=i; 30 while(1) 31 { 32 if(a[i][j]==‘W‘) 33 { 34 35 b[add].x=j; 36 b[add].y=i; 37 j--; 38 add++; 39 } 40 else if(a[i][j]==‘S‘) 41 { 42 43 b[add].x=j; 44 b[add].y=i; 45 add++; 46 i++; 47 } 48 else if(a[i][j]==‘E‘) 49 { 50 51 b[add].x=j; 52 b[add].y=i; 53 add++; 54 j++; 55 } 56 else if(a[i][j]==‘N‘) 57 { 58 59 b[add].x=j; 60 b[add].y=i; 61 add++; 62 i--; 63 } 64 if(i<1||j<1||i>leny||j>lenx) 65 { 66 cout<<add-1<<" step(s) to exit"<<endl; 67 break; 68 } 69 for(int k=1;k<add;k++) 70 { 71 if(b[k].x==j&&b[k].y==i) 72 { 73 cout<<k-1<<" step(s) before a loop of "<<add-k<<" step(s)"<<endl; 74 flag=1; 75 break; 76 } 77 } 78 if(flag) 79 break; 80 } 81 } 82 return 0; 83 }
标签：panel 分享 round end iat i++ har sample app
原文地址：http://www.cnblogs.com/dulute/p/7272686.html
