import java.util.Scanner;
public class 杨辉三角 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] a = new int[n + 1][n + 1];
for (int i = 1; i <= n; i++) {
a[i][1] = a[i][i]=1;
}
if (n > 2){
for(int i=1;i<=n;i++){
for(int j=2;j<= i;j++)
a[i][j]=a[i-1][j]+a[i-1][j-1];
}
}
for (int i = 1; i <= n ; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(a[i][j] + " ");
}
System.out.println();
}
}
}
Java实现 洛谷 P5732 【深基5.习7】杨辉三角
最新推荐文章于 2023-03-14 13:23:49 发布