【51nod】1101 换零钱

题目：

http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1101

代码：

#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int Mod=1e9+7;const int Maxn=1e5+10;int dp[Maxn];int main(){    int p[13]={1,2,5,10,20,50,100,200,500,1000,2000,5000,10000};    int N;    cin>>N;    dp[0]=1;    for(int i=0;i<13;i++)        for(int j=p[i];j<=N;j++)    {        dp[j]=(dp[j-p[i]]%Mod+dp[j])%Mod;    }    cout<<dp[N]<<endl;    return 0;}