摘要:
public class beg { public static final int N=7; public static final int S=15; int w[]={0,1,4,3,4,5,2,7}; boolean knap(int s,int n){ if(s==0) return tr 阅读全文
摘要:
int Top_Down_Rod(int p[],int n){ int r=0; int i; if(n==0)return 0; for (i=1;i<=n;i++){ int tmp=p[i]+Top_Down_Rod(p,n-i); count=count+1; System.out.pri 阅读全文