本文共 2223 字，大约阅读时间需要 7 分钟。

The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short while, before retiring to a comfortable job at a university.

For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.

His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.

30.04 31 0.022 0.033 0.050.06 32 0.032 0.033 0.050.10 31 0.032 0.023 0.05

246

#include
   
    #include
    
     using namespace std;int num[101];double percentage[101];double dp[10001];int main(){    int t,i,j,N;    double P;    cin>>t;    while(t--)    {        cin>>P>>N;        int sum=0;        for(i=0; i
     
      >num[i]>>percentage[i];            percentage[i]=1.0-percentage[i];            sum+=num[i];        }        memset(dp,0,sizeof(dp));        dp[0]=1;        for(i=0; i
      
       0; j--)            {                dp[j]=max(dp[j],dp[j-num[i]]*percentage[i]);            }        }        for(i=sum; i>=0; i--)        {            if(dp[i]+P>1)            {                cout<
       <
      
     
    
   

转载地址：https://blog.csdn.net/u010368749/article/details/20050279 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！