Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("siruri.in");
- ofstream fout("siruri.out");
- int v[1000],n,m;
- int valid(int k)
- {if(v[k]-v[k-1]>2&&k>1) return 0;
- for(int i=1; i<=k-1; i++)if(v[i]==v[k]||v[i]>v[k])return 0;
- return 1;
- }
- int solutii (int k)
- {
- if(k==m)return 1;
- return 0;
- }
- void afis(int k)
- {
- for(int i=1; i<=k; i++)fout<<v[i]<<" ";
- fout<<endl;
- }
- void backt(int k)
- {
- for(int i=1; i<=n; i++)
- {
- v[k]=i;
- if(valid(k)==1)if(solutii(k)==1)afis(k);
- else backt(k+1);
- }
- }
- int main()
- {
- fin>>n>>m;
- backt(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement