Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- using namespace std;
- int st[11], n;
- bool valid(int k)
- {
- for(int i=1; i<k; i++)
- {
- if(st[k]==st[i])
- {
- return 0;
- }
- }
- return 1;
- }
- bool solutie(int k)
- {
- return k==n;
- }
- void afis(int k)
- {
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=n; j++)
- {
- if(st[i]==j)
- {
- cout<<"1";
- }
- else
- {
- cout<<"0";
- }
- }
- cout<<endl;
- }
- cout<<endl;
- }
- void back(int k)
- {
- for(int i=1; i<=n; i++)
- {
- st[k]=i;
- if(valid(k))
- {
- if(solutie(k))
- {
- afis(k);
- }
- else
- {
- back(k+1);
- }
- }
- }
- }
- int main()
- {
- cin>>n;
- back(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement