greedy algorithm with all posible combinations of a given number

[peklo]

I need help with solving this problem. I can use numbers 20,10,5,2 or 1 and have to display all posible combinations.
input: 11
output:
10,1
5,5,1
5,2,2,2
5,2,2,1,1
5,2,1,1,1,1
5,1,1,1,1,1,1
2,2,2,2,2,1
2,2,2,2,1,1,1
2,2,2,1,1,1,1,1
2,2,1,1,1,1,1,1,1
2,1,1,1,1,1,1,1,1,1
1,1,1,1,1,1,1,1,1,1,1

[cire]

http://stackoverflow.com/questions/18305843/find-all-subsets-that-sum-to-a-particular-value
http://stackoverflow.com/questions/4632322/finding-all-possible-combinations-of-numbers-to-reach-a-given-sum

Your google-fu is lacking.

[peklo]

i m a newbie so i still lack knowlage to understand what the advanced programs say. is there mybe a version of program that only involves "for" and "if" functions ?

[cire]

is there mybe a version of program that only involves "for" and "if" functions ?

Neither "for" nor "if" are functions and I doubt a version using only "for" and "if" would be readable to anyone. The first link describes an algorithm in pseudo-code. Implement the algorithm with whatever constructs you are familiar with.

[peklo]

can you mybe work out something with this ?

#include <iostream>

using namespace std;

int main()
{
const int dvajset=20;
const int deset=10;
const int pet=5;
const int dva=2;
const int ena=1;
int vracilo;
cout << "vracilo: \n";
cin >> vracilo;

    for(int b=0;b<vracilo/ena;b++){
    for(int a=0;a<vracilo/dva;a++){
    for(int x=0;x<vracilo/pet;x++){
    for(int y=0;y<vracilo/deset;y++){
    for(int z=0;z<vracilo/dvajset;z++){
                            
    cout<<" 20eur.";
            }
    cout<<" 10eur.";
            }
    cout << " 5eur.";
            }
    cout<<" 2eur.";
            }
    cout<<" 1eur.";
            }

}