思路:
和种类01背包一样,外层种类,内层对于当前种类以此后推
#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <string>
#include <sstream>
using namespace std;
long long dp[100005];
const int mod=1e9+7;
int main()
{
dp[0]=1;
int save[15]={1,2,5,10,20,50,100,200,500,1000,2000,5000,10000};
int n;
cin>>n;
for(int i=0;i<=12;i++)
{
for( int j=save[i];j<=n;j++ )
dp[j]=(dp[j]+dp[j-save[i]])%mod;
}
cout<<dp[n]<<endl;
}