求助。。。为什么全是too many line or too few line

#include<iostream>
#include<cstdio>
using namespace std;
char sz[100000],xs[10000][10000],lj;
int main()
{
    int k,i=0,jsq=0;
    cin>>k;
    lj=getchar();
    while((sz[i]=getchar())!='\n')
        i++;
    for(int j=0;jsq<i;j+=k+3)
    {
        switch(sz[jsq])
        {
            case '0':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                    xs[2*k+2][j+s]='-';
                }
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s][j]='|';
                    xs[s][j+k+1]='|';
                }
                break;
            }
            case '1':
            {
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s][j+k+1]='|';
                }
                break;
            }
            case '2':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                    xs[k+1][j+s]='-';
                    xs[2*k+2][j+s]='-';
                }
                for(int s=0;s<=k+1;s++)
                {
                    xs[s][j+k+1]='|';
                    xs[s+k+1][j]='|';
                }
                break;
            }
            case '3':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                    xs[k+1][j+s]='-';
                    xs[2*k+2][j+s]='-';
                }
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s][j+k+1]='|';
                }
                break;
            }
            case '4':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[k+1][j+s]='-';
                }
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s-k-1][j]='|';
                    xs[s][j+k+1]='|';
                }
                break;
            }
            case '5':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                    xs[k+1][j+s]='-';
                    xs[2*k+2][j+s]='-';
                }
                for(int s=0;s<=k+1;s++)
                {
                    xs[s][j]='|';
                    xs[s+k+1][j+k+1]='|';
                }
                break;
            }
            case '6':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                    xs[k+1][j+s]='-';
                    xs[2*k+2][j+s]='-';
                }
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s][j]='|';
                    xs[s+k+1][j+k+1]='|';
                }
                break;
            }
            case '7':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                }
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s][j+k+1]='|';
                }
                break;
            }
            case '8':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                    xs[k+1][j+s]='-';
                    xs[2*k+2][j+s]='-';
                }
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s][j]='|';
                    xs[s][j+k+1]='|';
                }
                break;
            }
            case '9':
            {
                for(int s=0;s<=k;s++)
                {
                    xs[0][j+s]='-';
                    xs[k+1][j+s]='-';
                    xs[2*k+2][j+s]='-';
                }
                for(int s=0;s<=2*k+2;s++)
                {
                    xs[s-k-1][j]='|';
                    xs[s][j+k+1]='|';
                }
                break;
            }
        }
        xs[0][j]=xs[k+1][j]=xs[2*k+2][j]=xs[0][j+k+1]=xs[k+1][j+k+1]=xs[2*k+2][j+k+1]=' ';
        for(int s=0;s<=2*k+2;s++)
            xs[s][k+2]=' ';
        jsq++;
    }
    for(int j=0;j<=2*k+2;j++)
    {
        for(int s=0;s<=(3+k)*(i);s++)
        {
            if(xs[j][s]!='\0')
            cout<<xs[j][s];
            else
            cout<<" ";
        }
        cout<<endl;
    }
    return 0;
}
电脑上测试是全对的