UVA 10943全加和(规律),f(n,k)=f(0,k-1)+f(1,k-1)+.......f(n,k-1)#include#includeusingnamespacestd;intmain(){intn,k,i,j,a[105][105],l;while(cin>>n>>k&&(n+k)){memset(a,0,sizeof(a));for(i=1;i<=k;i++)for(j=0;j<=
UVA 10943全加和(规律),f(n,k)=f(0,k-1)+f(1,k-1)+.......f(n,k-1)#include#includeusingnamespacestd;intmain(){intn,k,i,j,a[105][105],l;while(cin>>n>>k&&(n+k)){memset(a,0,sizeof(a));for(i=1;i<=k;i++)for(j=0;j<=
UVA 10943全加和(规律),f(n,k)=f(0,k-1)+f(1,k-1)+.......f(n,k-1)#include#includeusingnamespacestd;intmain(){intn,k,i,j,a[105][105],l;while(cin>>n>>k&&(n+k)){memset(a,0,sizeof(a));for(i=1;i<=k;i++)for(j=0;j<=