Uva 674 Coin Change 完全背包

來源:互聯網
上載者:User

題目連結:here

題意:5種硬幣,輸出組合數

代碼:

#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int maxn = 7500;int coin[5] = {1,5,10,25,50};int dp[maxn];int m;int main(){int i, j;memset(dp, 0, sizeof(dp));dp[0] = 1;for (i=0; i<5; i++){for (j=coin[i]; j <= 7500; j++){if (j >= coin[i])dp[j] += dp[j-coin[i]];}}while (scanf("%d", &m) != EOF){printf("%d\n", dp[m]);}return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.