摘要:
#include#include#includeusing namespace std;int dp[2000000],t;void zeroonepack(int cost,int weight){ for(int i=t;i>=cost;i--) { d... 阅读全文
摘要:
#include#include#includeusing namespace std;int n,m,p[100+5],h[100+5],c[100+5],dp[100+5];void zeroonepack(int cost,int weight){ for(int i=n... 阅读全文
摘要:
#include#include#includeusing namespace std;int main(){ int i,j,p,n,m,k,s,a[120],b[120],dp[120][120]; while(~scanf("%d%d%d%d",&n,&m,&k,&... 阅读全文
摘要:
#include#include#includeusing namespace std;int d[1024][1024];int main(){ int _,i,j,k,n,X,Y,x[10+5],y[10+5],c[10+5]; scanf("%d",&_); ... 阅读全文
摘要:
#includeint main(){ long long int x; while(~scanf("%lld",&x)) { if(x%2==0) printf("0 0\n"); else printf("2 %lld\n",x+2)... 阅读全文
摘要:
#include#include#includeusing namespace std;int dp[35000];int main(){ int i,j,n; memset(dp,0,sizeof(dp)); dp[0]=1; for(i=1;i<=3;i+... 阅读全文
摘要:
#include#include#includeusing namespace std;int main(){ int _,n,dp[10000+5],i,j,a[5]; a[1]=150; a[2]=200; a[3]=350; memset(dp,0... 阅读全文
摘要:
#include#include#includeusing namespace std;int main(){ int n,m,i,j,w[10000+5]; double k[10000+5],dp[10000+5]; while(~scanf("%d%d",&n... 阅读全文