1 条题解

  • 0
    @ 2025-4-7 21:19:29

    C :

    #include<stdio.h>
    #include<stdlib.h>
    int main ()
    {
    	int a,b,c,d,e,h;
    	scanf("%d",&a);
    	a--;
    	for (b=1;b<=a;b++)
    		{ if (b==1) printf("1\n");
    	      printf("1");  		
    	for (c=1;c<=b;c++)
    		{ d=b;h=1;
    			for (e=1;e<=c;e++,d--)
    				h=h*d;
    			for (e=1;e<=c;e++)
    				h=h/e;
    		printf(" %d",h);
    	}
    	printf("\n");
    	}
    
    	return 0;
    
    }
    

    C++ :

    /*
    1
    1  1
    1  2  1
    1  3  3  1
     */
    #include<stdio.h>
    
    int main()
    {
        int i,j,n,a[11][11] = {0};
        n < 11;
        scanf("%d",&n);
        for(i = 0;i < n;i++)
        {
            a[i][0] = 1;
            a[i][i] = 1;
        }
    
        for(i = 2;i < n;i++)
          for(j = 1;j <= i;j++)
            a[i][j] = a[i-1][j] + a[i-1][j-1];
    
        for(i = 0;i < n;i++)
        {
            for(j = 0;j <= i;j++){
                if(j != i)
                    printf("%d ",a[i][j]);
                else
                    printf("%d",a[i][j]);
            }
            printf("\n");
        }
        return 0;
    }
    
    

    Pascal :

    var  
      n,i,j:longint;  
      a:array[0..1000,0..1000] of int64;  
    begin  
      readln(n);  
      a[1,1]:=1;
      for i:=2 to n do  
        for j:=1 to i do  
          a[i,j]:=a[i-1,j-1]+a[i-1,j];
      for i:=1 to n do begin  
    		for j:=1 to i-1 do write(a[i,j],' ');  
        writeln(a[i,i])  
      end;
    end. 
    
    • 1

    信息

    ID
    1204
    时间
    1000ms
    内存
    12MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者