Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- int st[100],n,a[100][100];
- ifstream f("comis.in");
- ofstream g("comis.out");
- void citire()
- {
- f>>n;
- for (int i=1;i<=n;i++)
- for (int j=1;j<=n;j++)
- {
- f>>a[i][j];
- }
- }
- bool succesor(int k)
- {
- if(st[k]<n)
- {
- st[k]++;
- return 1;
- }
- return 0;
- }
- bool valid(int k)
- {
- if (a[st[k]][st[k-1]]==0 && k>1)
- return 0;
- for (int i=1;i<k;i++)
- if (st[k]==st[i])
- return 0;
- return 1;
- }
- void tipar(int k)
- {
- for (int i=1;i<=k;i++)
- g<<st[i]<<" ";
- g<<'\n';
- }
- bool solutie (int k)
- {
- if (k==n && a[st[k]][1])
- return true;
- return false;
- }
- void bck()
- {
- int k,ok;
- k=2;
- st[1]=1;
- st[k]=0;
- while (k>1)
- {
- ok=0;
- while (ok==0 && succesor(k))
- ok=valid(k);
- if (ok==1)
- if (solutie(k))
- tipar(k);
- else
- st[++k]=0;
- else
- k--;
- }
- }
- int main()
- {
- citire();
- bck();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement