摘要:
#include#includeconst int MAXN=130;int dp[MAXN][MAXN];int calc(int n,int m){ if(dp[n][m]!=-1) return dp[n][m]; if(n0,1<=m<=N;My question is how man... 阅读全文
摘要:
#include #include double MAX(double a,double b){ return a>b?a:b;}int main(){ double f[10000],w[1010];int i,j,m,n,c[1010]; while (scanf("%d%d",&n,&m)!=... 阅读全文