Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void vypis(int a[], int k){
- int sucet=k;
- int sucet2=0;
- for (int z = 0; z<k; z++){
- cout << a[z];
- }
- cout<<endl;
- }
- void generuj(int a[], int i, int k, int sucet){
- /* v poli a dlzky k mame prvych i cifier,
- * chceme vygenerovat vsetky moznosti
- * poslednych k-i cifier */
- if (sucet == k)
- {
- vypis(a, i);
- } else if(sucet > k){
- return;
- } else {
- for (int x = 1; x < 3; x++)
- {
- a[i] = x;
- sucet += x;
- //cout<<"sucetPred "<<sucet<<endl;
- generuj(a, i + 1, k, sucet);
- sucet -= x;
- //cout<<"sucetPo "<<sucet<<endl;
- }
- }
- }
- int main() {
- const int maxK = 100;
- int a[maxK];
- int k;
- cin >> k;
- generuj(a, 0, k, 0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement