1858773_wa.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <string.h>

void main()
{
 int n;
 int i, j, l, k;
 char s[20], tmp[10000];
 
 while(scanf("%d%s",&n,s)==2&&n)
 {
  for(j = 0; j < 2*n+3; j++)
   {
    l = 0;memset(tmp,'\0',sizeof(tmp));
    for(i = 0; i < (n+2)*strlen(s); i++)
     {
      switch(s[i/(n+2)])
      {
       case '1': if(j==0||j==2*n+2||j==n+1) tmp[l++] =' '; else if(i%(n+2)==n+1) tmp[l++] ='|'; else tmp[l++] =' ';                         break;
       case '2': if(j==0||j==2*n+2||j==n+1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' ';else tmp[l++] ='-';
                  else {if(j<n+1) if(i%(n+2)==n+1) tmp[l++] ='|'; else tmp[l++] =' ';
                         if(j>n+1) if(i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';
                        }break;
       case '3': if(j==0||j==2*n+2||j==n+1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' ';else tmp[l++] ='-';
                  else if(i%(n+2)==n+1) tmp[l++] ='|'; else tmp[l++] =' ';
                        break;
       case '4': if(j==n+1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' '; else tmp[l++] ='-';
                  else if(j==0||j==2*n+2) tmp[l++] =' '; 
                        else {if(j > n + 1) if(i%(n+2)==n+1) tmp[l++] ='|'; else tmp[l++] =' '; 
                              if(j < n + 1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';}break;
       case '5': if(j==0||j == 2*n+2||j == n + 1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' ';else tmp[l++] ='-';
                  else {if(j > n + 1) if(i%(n+2)==n+1) tmp[l++] ='|'; else tmp[l++] =' ';
                         if(j < n + 1) if(i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';
                        }break;
       case '6': if(j==0||j == 2*n+2||j == n + 1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' ';else tmp[l++] ='-';
                  else {if(j > n + 1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';
                         if(j < n + 1) if(i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';
                        }break;
       case '7': if(j==0) if(i%(n+2)==n+1) tmp[l++] =' '; else tmp[l++] ='-';
                  else if(j==2*n+2||j==n+1) tmp[l++] =' '; else if(i%(n+2)==n+1) tmp[l++] ='|'; else tmp[l++] =' ';                         break;
       case '8': if(j==0||j == 2*n+2||j == n + 1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' ';else tmp[l++] ='-';
                  else  if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';
                        break;
       case '9': if(j==0||j == 2*n+2||j == n + 1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' ';else tmp[l++] ='-';
                  else {if(j < n + 1) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';
                         if(j > n + 1) if(i%(n+2)==n+1) tmp[l++] ='|'; else tmp[l++] =' ';
                        }break;
       case '0': if(j==n+1) tmp[l++] =' ';
                 else if(j==0||j == 2*n+2) if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] =' ';else tmp[l++] ='-';
                  else  if(i%(n+2)==n+1||i%(n+2)==0) tmp[l++] ='|'; else tmp[l++] =' ';
                        break;
       }
      if(i%(n+2)==n+1&&i!=(n+2)*strlen(s)-1) tmp[l++] = ' ';
   }
   for(k = l - 1; k>=0; k--)
    if(tmp[k]!=' ')
     break;
   if(tmp[k]=='-')  {tmp[k+1]=' ';tmp[k+2]='\0';}
   if(tmp[k]=='|'&&k!=l-1)  {tmp[k+1]=' ';tmp[k+2]='\0';}
    puts(tmp);
  }
  printf("\n");
 }
}