Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int findMin(int n)
- {
- int stamp[n+1];
- for(int i=0; i<=n&&i<=6; i++)
- {
- stamp[i] = i;
- }
- if(n>=7)
- stamp[7] = 1;
- if(n>=8)
- stamp[8] = 2;
- if(n>=9)
- stamp[9] = 3;
- if(n>=10)
- stamp[10] = 1;
- for(int i=11; i<=n; i++)
- {
- stamp[i] = 1+min( min(stamp[i-1],stamp[i-7]),stamp[i-10] );
- }
- return stamp[n];
- }
- int main()
- {
- int n;
- cout<<"Value of Postage: ";
- cin>>n;
- cout<<endl;
- int ans = findMin( n );
- cout<<"Minimum stamp required: "<<ans<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement