Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- using namespace std;
- int st[10], n;
- int valid(int niv)
- {
- if( (niv==0 || niv==n-1) && st[niv]!=0 ) return 0;
- /*int i;
- for(i=0; i<niv; i++)
- if(st[i]==st[niv])
- return 0;*/
- if(niv>0 && abs(st[niv]-st[niv-1])!=1) return 0;
- return 1;
- }
- void afisare_stiva()
- {
- int i;
- for(i=0; i<n; i++)
- cout<<st[i];
- cout<<endl;
- }
- void back(int nivel)
- {
- if (nivel>n) afisare_stiva();
- else
- {
- for(int i=0; i<=n; i++)
- {
- st[nivel]=i;
- if(valid(nivel)) back(nivel+1);
- }
- }
- }
- int main()
- {
- cin>>n;
- back(0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment