Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int st[50], n;
- int abs(int x)
- {
- if(x>0)
- return x;
- else
- return -x;
- }
- int Valid(int p)
- {
- for(int i=1;i<p;i++)
- if(st[i]==st[p] || abs(st[p]-st[i])==abs(p-i))
- return 0;
- return 1;
- }
- int Solutie(int p)
- {
- return n==p;
- }
- void Tipar()
- {
- for(int i=1;i<=n;i++)
- cout<<st[i]<<" ";
- cout<<endl;
- }
- void bkt(int p)
- {
- for(int i=1;i<=n;i++)
- {
- st[p]=i;
- if (Valid(p))
- {
- if (Solutie(p))
- Tipar();
- else
- bkt(p+1);
- }
- }
- }
- int main()
- {
- cin>>n;
- bkt(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement