#include <iostream>
using namespace std;

char a1[9]="*0010010",
	 a2[9]="*1011101",
	 a3[9]="*1011011",
	 a4[9]="*0111010",
	 a5[9]="*1101011",
	 a6[9]="*1101111",
	 a7[9]="*1010010",
	 a8[9]="*1111111",
	 a9[9]="*1111010",
	 a0[9]="*1110111";
int number[9],length;

int lprint(int,int);
int hprint(int,int);
int deal(int);
int dev(int,unsigned long int);

int lprint(int s,int n){
    char n1,n2;

	for (int i=0;i<s;i++){
		for (int j=length;j>=0;j--){
	        switch (number[j]){
	        case 1:n1=a1[n];n2=a1[n+1];break;
            case 2:n1=a2[n];n2=a2[n+1];break;
	        case 3:n1=a3[n];n2=a3[n+1];break;
	   	    case 4:n1=a4[n];n2=a4[n+1];break;
	        case 5:n1=a5[n];n2=a5[n+1];break;
	        case 6:n1=a6[n];n2=a6[n+1];break;
	        case 7:n1=a7[n];n2=a7[n+1];break;
	        case 8:n1=a8[n];n2=a8[n+1];break;
	        case 9:n1=a9[n];n2=a9[n+1];break;
	        case 0:n1=a0[n];n2=a0[n+1];break;
			}
			if (n1=='1')
				cout<<"|";
			else cout<<" ";
			for (int j=0;j<s;j++)
				cout<<" ";
			if (n2=='1')
				cout<<"| ";
			else cout<<"  ";
		}
		cout<<endl;
	}
    return 0;
}

int hprint(int s,int n){
    char c;

    for (int i=length;i>=0;i--){
	    switch (number[i]){
	    case 1:c=a1[n];break;
        case 2:c=a2[n];break;
        case 3:c=a3[n];break;
   	    case 4:c=a4[n];break;
        case 5:c=a5[n];break;
        case 6:c=a6[n];break;
        case 7:c=a7[n];break;
        case 8:c=a8[n];break;
        case 9:c=a9[n];break;
        case 0:c=a0[n];break;
		}
	cout<<" ";
	if (c=='1') c='-';
	else c=' ';
	for (int j=0;j<s;j++)
		cout<<c;
	cout<<"  ";
	}
	cout<<endl;
    return 0;
}

int deal(int s){

    for (int i=1;i<=7;i++){
	    if ( (i==3) || (i==6) )
		    continue;
	    switch (i){
	    case 1:hprint(s,1);break;
        case 4:hprint(s,4);break;
	    case 7:hprint(s,7);break;
	    case 2:lprint(s,2);break;
	    case 5:lprint(s,5);break;
		}
	}
	return 0;
}

int dev(int s,unsigned long int n){

	length=0;
    while (n>10){
		number[length]=n-(n/10)*10;
		n=n/10;
		length++;
	}
	number[length]=n;
    deal(s);	
    return 0;
}
int main(){
	unsigned long int a;
    int s;
    
    while ( s && a ){
		cin>>s>>a;
		dev(s,a);
	}
    return 0;
}
天啊，怎么测都过不去阿．．．．
郁闷了这下．．
救命啊～～

• Re:没用二维数组写所以长了点，大虾们凑合着看吧．．． (0) lunch 2007-02-11 02:53:40
• Re:哪位大虾帮我看看我的１１０２题啊．．．． (47) lunch 2007-02-12 02:52:41