#include <queue>
#include <math.h>
#include <stack>
#include <vector>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include<cstring>
#include <algorithm>
#define LL long long
const int N=1e2+10;
const int INF = 0x3f3f3f3f;
using namespace std;
int n,i,j,a[N][N];
int main(int argc,char const*argv[]) {
	cin>>n;
	int s=1;
	int k=n;
	i=n-1;
	j=0;
	int s1=0,s2;
	while(k){ 
		k--; 
		while(i<=n-1){
			a[i][j]=s;
			s1=i;
			i++,j++;
			s++; 
		}	
		i=k; 
		i--;
		j=0;
	} 
	for(i=0;i<n;i++){ 
		for(j=0;j<n;j++){
			if(a[i][j]!=0){
				printf("%4d",a[i][j]); 
			}
		} 
		printf("\n"); 
	}
	return 0;
}

其他题解好像都在Ctrl大佬的呀（除某V10dalao）bushi我

谁说的@何辰恩

#include<bits/stdc++.h>
using namespace std;
const int N=3e1+5,INF=0x3f3f3f3f;
int n,a[N][N],h=1,l,cnt;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++){
		l = i;
		while(l>0){
			a[h][l] = ++cnt;
			h++;
			l--;
		}
		h = 1;
	}
	for(int i=n;i>=1;i--){
		for(int j=1;j<=n+1-i;j++)cout<<setw(4)<<a[j][i]<<" ";
		cout<<endl;
	}
}

#include<stdio.h> int main(int argc,char const*argv[]) { int n,i,j,a[100][100]={0}; scanf("%d",&n); int s=1; int k=n; i=n-1; j=0; int s1=0,s2; while(k) { k--; while(i<=n-1) { a[i][j]=s; s1=i; i++,j++; s++; } i=k; i--;j=0; } for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(a[i][j]!=0) printf("%4d",a[i][j]); } printf("\n"); } }

#include<stdio.h> int main(int argc,char const*argv[]) { int n,i,j,a[100][100]={0}; scanf("%d",&n); int s=1; int k=n; i=n-1; j=0; int s1=0,s2; while(k) { k--; while(i<=n-1) { a[i][j]=s; s1=i; i++,j++; s++; } i=k; i--;j=0; } for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(a[i][j]!=0) printf("%4d",a[i][j]); } printf("\n"); } }