#include<bits/stdc++.h>
//#include<windows.h>
#define ll long long
#define Test ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define R(i,j) for(auto i:j)
//nth_element
using namespace std;
const int N=1e5+10,NN=1e3+10;//警钟敲烂
ll n,m,k,len,T,ans;
ll minn=INT_MAX,maxn=0;
char s[N];
ll arr[N];

int a[10]={1,0,1,1,0,1,1,1,1,1};
int b[10]={1,0,0,0,1,1,1,0,1,1};
int c[10]={1,1,1,1,1,0,0,1,1,1};
int d[10]={0,0,1,1,1,1,1,0,1,1};
int e[10]={1,0,1,0,0,0,1,0,1,0};
int f[10]={1,1,0,1,1,1,1,1,1,1};
int g[10]={1,0,1,1,0,1,1,0,1,1};
//struct TT{};
char ks;
signed main(){
	Test;
  	cin>>n;
  	cin>>s;
  	int len = strlen(s);
  	for(int i = 0;i<len;i++){
  		printf(" ");
  		char ks;
  		if(a[s[i]-'0'])ks='-';
  		else ks=' ';
  		for(int j=1;j<=n;j++){
  			printf("%c",ks);
		}
		printf(" ");
		if(i!=len-1)printf(" ");
	}
	printf("\n");
    for(int j=1;j<=n;j++){
    	char ks;
    for(int i=0;i<len;i++){
        if(b[s[i]-'0']) ks='|';else ks=' ';
		printf("%c",ks); 
        for(int k=1;k<=n;k++) printf(" ");
        if(c[s[i]-'0']) ks='|';else ks=' ';
		printf("%c",ks);
        if(i!=len-1) printf(" ");
    }
        printf("\n");
	}
	for(int i = 0;i<len;i++){
		char ks;
  		printf(" ");
  		if(d[s[i]-'0'])ks='-';
  		else ks=' ';
  		for(int j=1;j<=n;j++){
  			printf("%c",ks);
		}
		printf(" ");
		if(i!=len-1)printf(" ");
	}
	printf("\n");
    for(int j=1;j<=n;j++){
    	char ks;
    for(int i=0;i<len;i++){
        if(e[s[i]-'0']) ks='|';else ks=' ';printf("%c",ks); 
        for(int k=1;k<=n;k++) printf(" ");
        if(f[s[i]-'0']) ks='|';else ks=' ';printf("%c",ks);
        if(i!=len-1) printf(" ");
    }
        printf("\n");
	}
	for(int i = 0;i<len;i++){
		char ks;
  		printf(" ");
  		if(g[s[i]-'0'])ks='-';
  		else ks=' ';
  		for(int j=1;j<=n;j++){
  			printf("%c",ks);
		}
		printf(" ");
		if(i!=len-1)printf(" ");
	}
	return 0;
}

printf能过。

#include<bits/stdc++.h>
//#include<windows.h>
#define ll long long
#define Test ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define R(i,j) for(auto i:j)
//nth_element
using namespace std;
const int N=1e5+10,NN=1e3+10;//警钟敲烂
ll n,m,k,len,T,ans;
ll minn=INT_MAX,maxn=0;
char s[N];
ll arr[N];

int a[10]={1,0,1,1,0,1,1,1,1,1};
int b[10]={1,0,0,0,1,1,1,0,1,1};
int c[10]={1,1,1,1,1,0,0,1,1,1};
int d[10]={0,0,1,1,1,1,1,0,1,1};
int e[10]={1,0,1,0,0,0,1,0,1,0};
int f[10]={1,1,0,1,1,1,1,1,1,1};
int g[10]={1,0,1,1,0,1,1,0,1,1};
//struct TT{};
char ks;
signed main(){
	Test;
  	cin>>n;
  	cin>>s;
  	int len = strlen(s);
  	for(int i = 0;i<len;i++){
  		cout<<" ";
  		char ks;
  		if(a[s[i]-'0'])ks='-';
  		else ks=' ';
  		for(int j=1;j<=n;j++){
  			cout<<ks;
		}
		cout<<" ";
		if(i!=len-1)cout<<" ";
	}
	printf("\n");
    for(int j=1;j<=n;j++){
    	char ks;
    for(int i=0;i<len;i++){
        if(b[s[i]-'0']) ks='|';else ks=' ';
		printf("%c",ks); 
        for(int k=1;k<=n;k++) printf(" ");
        if(c[s[i]-'0']) ks='|';else ks=' ';
		printf("%c",ks);
        if(i!=len-1) printf(" ");
    }
        printf("\n");
	}
	for(int i = 0;i<len;i++){
		char ks;
  		cout<<" ";
  		if(d[s[i]-'0'])ks='-';
  		else ks=' ';
  		for(int j=1;j<=n;j++){
  			cout<<ks;
		}
		cout<<" ";
		if(i!=len-1)cout<<" ";
	}
	printf("\n");
    for(int j=1;j<=n;j++){
    	char ks;
    for(int i=0;i<len;i++){
        if(e[s[i]-'0']) ks='|';else ks=' ';printf("%c",ks); 
        for(int k=1;k<=n;k++) printf(" ");
        if(f[s[i]-'0']) ks='|';else ks=' ';printf("%c",ks);
        if(i!=len-1) printf(" ");
    }
        printf("\n");
	}
	for(int i = 0;i<len;i++){
		char ks;
  		cout<<" ";
  		if(g[s[i]-'0'])ks='-';
  		else ks=' ';
  		for(int j=1;j<=n;j++){
  			cout<<ks;
		}
		cout<<" ";
		if(i!=len-1)cout<<" ";
	}
	return 0;
}

不能过。

问我只改了cout成printf为什么能过