第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-449 递归输出数字三角形

#include<stdio.h>
int i=1,a=1;
void abc(int n)
{
  int j,b; 
  if(n==0)
  return;
  else
  {
  for(j=n-1;j>0;j--)
    printf(" ");
    for(b=i;b>0;b--)
      printf("%d ",a++);
    printf("\n");
    i++;
  abc(n-1);
  }
}
int main()
{
  int n,a=1,i,b,j;
  scanf("%d",&n);
  abc(n);
  return 0;
}

#include<iostream>
using namespace std;
int main()
{
  int N;
  cin>>N;
  int i,j,k=1;
  for(i=1;i<=N-1;i++)
  {
    for(j=1;j<=N-1-i;j++)
      cout<<" ";
    for(j=1;j<=i;j++)
      cout<<" "<<k++;
    cout<<endl;
  }
  cout<<k++;
  for(j=1;j<=N-1;j++)
    cout<<" "<<k++;
  return 0;
}

import java.io.*;
public class Main {
  public static void main(String[] args) throws NumberFormatException, IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int n = Integer.parseInt(br.readLine());
    int x = 1;
    StringBuilder builder = new StringBuilder();
    for(int i = 1;i <= n;i++) {
      for(int j = n - i;j > 0;j--) {
        builder.append(" ");
      }
      for(int j = 1; j < i;j++) {
        builder.append(x + " ");
        x++;
      }
      builder.append(x);
      x++;
      builder.append("\n");
    }
    System.out.print(builder.toString());
  }
}

def sum(n):
    c=0
    for i in range(1,n+1):
        c+=i
    return c
def show(arr):
    print(" "*abs(len(arr)-n),end="")
    for i in arr:
        print(i,end=" ")
    print()
def fun(start,step):
    if step==n+1:
        return
    show(arr[start:start+step])
    fun(start+step,step+1)
    
if __name__=='__main__':
    n=int(input())
    arr=[i+1 for i in range(sum(n))]
    fun(0,1)