T了5个点求优化

// luogu-judger-enable-o2
// luogu-judger-enable-o2
#include<bits/stdc++.h>
#define MAXN 5000
using namespace std;
int main(){
    int a[MAXN];
    memset(a,0,sizeof(a));
    int n;
    a[0]=1;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        for(int j=0;j<MAXN;j++)a[j]*=2;
        for(int j=0;j<MAXN;j++){
            a[j+1]+=a[j]/10;
            a[j]=a[j]%10;
        }
    }
    int k=MAXN-1;
    while(a[k]==0)k--;
    printf("%d\n",k+1);
    a[0]--;
    for(int i=499;i>=0;i--){
        printf("%d",a[i]);
        if(i%50==0)printf("\n");
    }
}