Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <algorithm>
- using namespace std;
- ifstream fin("siruri.in");
- ofstream fout("siruri.out");
- int st[10], n, m, v[100];
- int valid(int niv)
- {
- int i;
- for(i=1; i<=niv; i++){
- if(st[i+1]-st[i]>2 && i<niv) return 0;
- for(int j=i+1;j<=niv;j++)
- {
- if(st[i]>=st[j]) return 0;
- }
- }
- return 1;
- }
- void afisare_stiva()
- {
- int i;
- for(i=1; i<=n; i++)
- fout<<st[i]<<" ";
- fout<<endl;
- }
- void back(int nivel)
- {
- if (nivel>n) afisare_stiva();
- else
- {
- for(int i=1; i<=m; i++)
- {
- st[nivel]=i;
- if(valid(nivel)) back(nivel+1);
- }
- }
- }
- int main()
- {
- fin>>m;
- fin>>n;
- back(1);
- fin.close();
- fout.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement