Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int sol, n, x[100],maxim;
- void init(int k)
- {
- x[k]=0;
- }
- int existaSuccesor(int k)
- {
- maxim=0;
- for(int i=0;i<k;i++)
- if(x[i]>maxim)
- maxim=x[i];
- return x[k]<=maxim;
- }
- int cont(int k)
- {
- return 1;
- }
- int solutie(int k)
- {
- return k==n;
- }
- void tipar()
- {
- sol++;
- cout<<"\nPartitia "<<sol<<":"<<endl;
- if(maxim<x[n]) maxim=x[n];
- for(int m=1; m<=maxim; m++)
- {
- cout<<"Submultimea "<<m<<": ";
- for(int i=1;i<=n;i++)
- if(x[i]==m)
- cout<<i<<" ";
- cout<<endl;
- }
- cout<<endl;
- }
- void back()
- {
- int k=1;
- init(1);
- while(k>0)
- {
- if(existaSuccesor(k))
- {
- x[k]++;
- if(cont(k))
- if(solutie(k))
- tipar();
- else
- {
- k++;
- init(k);
- }
- }
- else
- k--;
- }
- }
- int main()
- {
- cout<<"cate persoane sunt? "; cin>>n;
- cout<<"Submultimile de bisericute sunt: "<<endl;
- back();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement