Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int st[10],n;
- int valid(int k)
- {
- for(int i=1;i<k;i++)
- if(st[k]==st[i])
- {return 0;}
- return 1;
- }
- int solutie(int k)
- {
- return k==n;
- }
- void tipar(int k)
- {
- for(int i=1;i<=k;i++)
- {for(int j=1;j<=k;j++)
- if(j==st[i])
- cout<<"T";
- else
- cout<<"0";
- cout<<endl;
- }
- cout<<endl;
- }
- void init(int k)
- {
- st[k]=0;
- }
- int succesor(int k)
- {
- if(st[k]<n)
- {st[k]++;
- return 1;}
- else
- {return 0;}
- }
- void back()
- {
- int k,Ev,As;
- k=1;
- init(k);
- while(k>=1)
- {do{
- As=succesor(k);
- if(As==1)
- {Ev=valid(k);}}
- while(As==1&&Ev==0);
- if(As==1){
- if(solutie(k)){
- tipar(k);}
- else{
- k++;
- init(k);}
- }
- else{
- k--;
- }}
- }
- int main()
- {
- cout<<"n=";
- cin>>n;
- back();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement