Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f ("submultimi1.in");
- ofstream g ("submultimi1.out");
- int n,st[100],k;
- void init()
- {
- st[k]=0;
- }
- int succesor()
- {
- while(st[k]<n)
- {
- st[k]++;
- return 1;
- }
- return 0;
- }
- int valid()
- {
- if(k>1)
- if(st[k]-st[k-1]==1)
- return 0;
- if(st[k-1]>=st[k])
- return 0;
- return 1;
- }
- void tipar()
- {
- for(int i=1;i<=k;i++)
- g<<st[i]<<' ';
- g<<endl;
- }
- void bak()
- {
- int as;
- k=1;
- init();
- while(k>0)
- {
- while((as=succesor()) && !valid());
- if(as)
- {
- tipar();
- k++;
- init();
- }
- else
- k--;
- }
- }
- int main()
- {
- f>>n;
- bak();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement