Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int a[2]={ 4,3};
- int st[2];
- int n=2;
- 1) l7
- int succesor(int k, int i)
- {
- if (i<=a[k])
- {st[k]=i;
- return 1;}
- else return 0;
- }
- void tipar(int k)
- {
- for(int i=0;i<k;i++)
- cout<<st[i]<<" ";
- cout<<endl;
- }
- int solutie(int k)
- {
- return k==n;
- }
- void back(int k)
- {
- if (solutie(k))
- tipar(k);
- else{
- int i=1;
- while(succesor(k,i))
- {
- back(k+1);
- i++;
- }}}
- void main()
- {
- back(0);
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement