HDU 1203 I NEED A OFFER!(01背包)
2016-09-13 15:42
459 查看
// // main.cpp // Richard // // Created by 邵金杰 on 16/9/13. // Copyright © 2016年 邵金杰. All rights reserved. // #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn=10000+100; double dp[maxn],p[maxn]; int w[maxn]; int main() { int n,m; while(scanf("%d%d",&n,&m)&&(n+m)) { for(int i=0;i<m;i++) { scanf("%d%lf",&w[i],&p[i]); } for(int i=0;i<=n;i++) dp[i]=1; for(int i=0;i<m;i++) { for(int j=n;j>=w[i];j--) { dp[j]=min(dp[j],dp[j-w[i]]*(1-p[i])); } } printf("%.1f%%\n",(1-dp )*100); } return 0; }
相关文章推荐
- I NEED A OFFER! hdu 1203 01 背包
- HDU 1203 I NEED A OFFER!(01背包基础题)
- hdu 1203 I NEED A OFFER!--01背包
- [HDU 1203 I NEED A OFFER!] 01背包
- 【HDU 1203】 I NEED A OFFER!(01背包)
- HDU - 1203 I NEED A OFFER! (01背包变形)
- HDU 1203 I NEED A OFFER!(01 背包DP)
- hdu 1203 I NEED A OFFER! 不错的01背包求最小值
- HDU 1203 I NEED A OFFER!(01背包概率问题)
- HDU1203--I NEED A OFFER!--01背包
- HDU 1203 I NEED A OFFER! ,01背包改编。
- hdu 1203 I NEED A OFFER!(0/1背包)
- hdu 1203 I NEED A OFFER! <背包的变形>
- HDU 1203 I NEED A OFFER! (01DP)
- hdu 1203 I NEED A OFFER!(dp||背包)
- HDU 1203 I NEED A OFFER! (背包的多项式操作)
- I NEED A OFFER! 1203 (01背包变形+数学)
- HDU-1203 I NEED A OFFER!(0、1背包)
- hdu 1203 I NEED A OFFER (0-1背包)
- HDU-1203 I NEED A OFFER!-0、1背包及空间优化