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