1138.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1138 on 2005-03-18 at 23:12:37 */ 
#include <stdio.h>
#include <string.h>

typedef struct{
    int vert[2][2];
    int hori[3];
}Number;    

int main()
{
    int s, nLength, a;
    char n[9];
    int i, j, k, l, m, p;
    Number number[9];
    
    while(scanf("%d %s", &s, n) == 2){
        if((s == 0) && (n[0] == '0')){
            return 0;
        }else{
            nLength = strlen(n);
            m = 0;
            p = 0;
            for(i = 0; i < nLength; i++){
                switch(n[i]){
                    case '0':
                        number[i].vert[0][0] = 1;
                        number[i].vert[0][1] = 1;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 0;
                        number[i].hori[2] = 1;
                        break;
                    case '1':
                        number[i].vert[0][0] = 0;
                        number[i].vert[0][1] = 0;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 0;
                        number[i].hori[1] = 0;
                        number[i].hori[2] = 0;
                        break;
                    case '2':
                        number[i].vert[0][0] = 0;
                        number[i].vert[0][1] = 1;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 0;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 1;
                        number[i].hori[2] = 1;
                        break;
                    case '3':
                        number[i].vert[0][0] = 0;
                        number[i].vert[0][1] = 0;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 1;
                        number[i].hori[2] = 1;
                        break;
                    case '4':
                        number[i].vert[0][0] = 1;
                        number[i].vert[0][1] = 0;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 0;
                        number[i].hori[1] = 1;
                        number[i].hori[2] = 0;
                        break;
                    case '5':
                        number[i].vert[0][0] = 1;
                        number[i].vert[0][1] = 0;
                        number[i].vert[1][0] = 0;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 1;
                        number[i].hori[2] = 1;
                        break;
                    case '6':
                        number[i].vert[0][0] = 1;
                        number[i].vert[0][1] = 1;
                        number[i].vert[1][0] = 0;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 1;
                        number[i].hori[2] = 1;
                        break;
                    case '7':
                        number[i].vert[0][0] = 0;
                        number[i].vert[0][1] = 0;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 0;
                        number[i].hori[2] = 0;
                        break;
                    case '8':
                        number[i].vert[0][0] = 1;
                        number[i].vert[0][1] = 1;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 1;
                        number[i].hori[2] = 1;
                        break;
                    case '9':
                        number[i].vert[0][0] = 1;
                        number[i].vert[0][1] = 0;
                        number[i].vert[1][0] = 1;
                        number[i].vert[1][1] = 1;
                        number[i].hori[0] = 1;
                        number[i].hori[1] = 1;
                        number[i].hori[2] = 1;
                        break;
                }
            }
            a = 2 * s + 3;
            for(i = 0; i < a; i++){
                if(i > s + 1){
                    p = 1;
                }
                if((i == s+1) || (i == 2*s+2)){
                    m++;
                }
                for(j = 0; j < nLength; j++){
                    if((i == 0) || (i == s+1) || (i == 2*s+2)){
                        if(j != 0){
                            printf(" ");
                        }
                        printf(" ");
                        for(k = 0; k < s; k++){
                            if(number[j].hori[m] == 1){
                                printf("-");
                            }else{
                                printf(" ");
                            }    
                        }
                        printf(" ");
                    }else{
                        if(j != 0){
                            printf(" ");
                        }    
                        if(number[j].vert[0][p] == 1){
                            printf("|");
                        }else{
                            printf(" ");
                        }
                        for(l = 0; l < s; l++){
                            printf(" ");
                        }
                        if(number[j].vert[1][p] == 1){
                            printf("|");
                        }else{
                            printf(" ");
                        }
                    }
                }
                printf("\n");
            }
            printf("\n");
        }
    }
    
    return 0;
}