zoukankan      html  css  js  c++  java
  • 杨辉三角

    public class yanghui {  

                          public static void main(String args[]){   

                                    int[][] a; 

                                     a=new int [5][5];   

                                      int i,j;  

                                       for(i=0;i<5;i++){    

                                                              for(j=0;j<=i;j++){    

                                                                            if(j==0||j==i)     

                                                                                 a[i][j]=1;        

                                                                        else     

                                                                       a[i][j]=a[i-1][j-1]+a[i-1][j];        

                                                                       System.out.print(a[i][j]+"") ;}     

                                                                        System.out.print(" ");   

     }      

     }  

    }

  • 相关阅读:
    luogu P3704 [SDOI2017]数字表格
    「雅礼集训 2018 Day4」Magic(分治NTT)
    「清华集训 2017」小 Y 和恐怖的奴隶主
    [WC2019]数树(树形dp+多项式exp)
    「FJWC2020Day5-zzq」lg (容斥)
    BoundedOptimization TopCoder
    MapGuessing TopCoder
    线性递推(Berlekamp-Massey 算法)
    杜教筛小记
    「余姚中学 2019 联测 Day 6」解码
  • 原文地址:https://www.cnblogs.com/fangfuyingcom/p/6795599.html
Copyright © 2011-2022 走看看