一维数组解法

using namespace std;
const int A=10000;
int n[A];
int main(){
	int a;
	cin>>a;
	int b=0;
	n[0]=1;
	for(int i=a;i<=a*a-1;i+=a){
		n[i]=1;
		}
	for(int k=0;k<=a*a-1;k++){
		n[k+a+1]=n[k]+n[k+1];
	}
	for(int o=0;o<=a*a-1;o++){
		b++;
		if(n[o]!=0){
			cout<<n[o]<<" ";
		}
		if(b==a){
			b=0;
			cout<<endl;
		}
	}
	return 0;
}