1238.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 56 行

/*  This Code is Submitted by wywcgs for Problem 1238 on 2005-09-16 at 21:17:52 */ 
#include <stdio.h>

int main()
{
    char square[32][32], ch;
    int nowx, nowy, test;
    int i, j, k;
    
    scanf("%d", &test);
    for(i = 0; i < test; i++) {
        for(j = 0; j < 32; j++) {
            for(k = 0; k < 32; k++) {
                square[j][k] = '.';
            }    
        }
        scanf("%d %d", &nowx, &nowy); 
        while(1) {
            ch = getchar();
            if(ch == '.') {
                while(getchar() != '\n')
                    ;
                break;
            } else {
                switch(ch) {
                    case 'W':
                        nowx--;
                        square[nowy][nowx] = 'X';
                        break;
                    case 'E':
                        square[nowy-1][nowx] = 'X';
                        nowx++;
                        break;
                    case 'N':
                        square[nowy][nowx] = 'X';
                        nowy++;
                        break;
                    case 'S':
                        nowy--;
                        square[nowy][nowx-1] = 'X';
                        break;
                }    
            }        
        }
        printf("Bitmap #%d\n", i+1);
        for(j = 0; j < 32; j++) {
            for(k = 0; k < 32 ; k++) {
                putchar(square[31-j][k]);
            }
            putchar('\n');
        }
        putchar('\n');
    }
    
    return 0;
}