杨辉三角

#include<stdio.h>#define SIZE 26int A[SIZE][SIZE];void f_Triangle(int P){int result;int m,n;int i,j;scanf("%d %d",&m,&n);for(i=1;i<SIZE;i++){A[i][1] = 1;A[i][i] = 1;}for(i=3;i<=m;i++)for(j=2;j<i;j++){if(j<1)A[i][j]=1;elseA[i][j] = A[i-1][j]+A[i-1][j-1];}result = A[m][n];printf("#%d %d",P,result);printf("\n");}int main(){int T,i;scanf("%d",&T);for(i = 1;i<=T;i++)f_Triangle(i);return 0;}