UVA 706 LC-Display

WA了好几发才发现9下面少了一横，OMG！！！

一个简单的模拟，细心就能过

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <cmath>#include <vector>using namespace std;int N,M;int a[200],cnt;char str[100];void heng_1(){for(int i = cnt-1; i >= 0; i--){if(i != cnt-1)printf(" ");printf(" ");if(a[i] == 1 || a[i] == 4){for(int j = 0; j < N; j++)printf(" ");}else{for(int j = 0; j < N; j++)printf("-");}printf(" ");}}void heng_2(){for(int i = cnt-1; i >= 0; i--){if(i != cnt-1)printf(" ");printf(" ");if(a[i] == 0 || a[i] == 1 || a[i] == 7){for(int j = 0; j < N; j++)printf(" ");}else{for(int j = 0; j < N; j++)printf("-");}printf(" ");}}void heng_3(){for(int i = cnt-1; i >= 0; i--){if(i != cnt-1)printf(" ");printf(" ");if(a[i] == 1 || a[i] == 4 || a[i] == 7){for(int j = 0; j < N; j++)printf(" ");}else{for(int j = 0; j < N; j++)printf("-");}printf(" ");}}void shu_1(){for(int i = cnt-1; i >= 0; i--){if(i != cnt-1)printf(" ");if(a[i] == 0 || a[i] == 4 || a[i] == 8 || a[i] == 9){printf("|");for(int j = 0; j < N; j++)printf(" ");printf("|");}else if(a[i] == 5 || a[i] == 6){printf("|");for(int j = 0; j < N; j++)printf(" ");printf(" ");}else{printf(" ");for(int j = 0; j < N; j++)printf(" ");printf("|");}}}void shu_2(){for(int i = cnt-1; i >= 0; i--){if(i != cnt-1)printf(" ");if(a[i] == 0 || a[i] == 6 || a[i] == 8){printf("|");for(int j = 0; j < N; j++)printf(" ");printf("|");}else if(a[i] == 2){printf("|");for(int j = 0; j < N; j++)printf(" ");printf(" ");}else{printf(" ");for(int j = 0; j < N; j++)printf(" ");printf("|");}}}int main(){while(~scanf("%d %s",&N,str) && N){cnt = 0;for(int i = strlen(str)-1; i >= 0 ; i--){a[cnt++] = str[i]-'0';}heng_1();puts("");for(int i = 0; i < N; i++){shu_1();puts("");}heng_2();puts("");for(int i = 0; i < N; i++){shu_2();puts("");}heng_3();puts("");puts("");}return 0;}