Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<cstring>
- using namespace std;
- int x[100],n,k,m;
- int valid(int k)
- {
- if(k>1 && x[k]<=x[k-1])
- return 0;
- return 1;
- }
- int solutie(int k)
- {
- if(k==m)
- return 1;
- else
- return 0;
- }
- void tipar(int k)
- {
- int i;
- for(i=1;i<=k;i++)
- cout<<x[i]<<" ";
- cout<<endl;
- }
- void bit(int k)
- {
- int i;
- for(i=1;i<=n;i++)
- {
- x[k]=i;
- if(valid(k)==1)
- if(solutie(k)==1)
- tipar(k);
- else
- bit(k+1);
- }
- }
- int main()
- {
- cin>>n>>m;
- bit(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement