Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n,st[10],k,p;
- void init()
- {
- st[k]=0;
- }
- int suc()
- {
- if(st[k]<n)
- {
- st[k]++;
- return 1;
- }
- return 0;
- }
- int valid()
- {
- int i;
- for(i=1;i<=k-1;i++)
- if(st[k]==st[i])
- return 0;
- return 1;
- }
- int sol()
- {
- return k==p;
- }
- void afis()
- {
- int i;
- for(i=1;i<=p;i++)
- cout<<st[i]<<" ";
- cout<<endl;
- }
- void back()
- {
- int s;
- k=1;
- init();
- while(k>0)
- {
- do
- {}
- while((s=suc()) && valid()==0);
- if(s==1)
- if(sol()==1)
- afis();
- else
- {
- k++;
- init();
- }
- else
- k--;
- }
- }
- int main()
- {
- cout<<"n=";
- cin>>n;
- cout<<"p=";
- cin>>p;
- back();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement