Breaking News: Grepper is joining You.com. Read the official announcement!

backtrack

Yucky Yak answered on May 29, 2022 Popularity 10/10 Helpfulness 2/10

answer backtrack

backtrack

Comment

#include <iostream>
using  namespace std;
 
int n, kq[11], dd[10];
 
void xuat()
{
    for (int j=1; j<=n; j++)
        cout<< kq[j]<<" ";
    cout << endl;
}
 
void backtrack(int i)
{
    if (i>n) xuat();
    for (int j=1; j<=n; j++)
        if (dd[j]==0)
        {
            dd[j]=1;
            kq[i]=j;
            backtrack(i+1);
            dd[j]=0;
        }
}
 
int main()
{
    cin >> n;
    for (int i=1; i<=9; i++)
        dd[i]=0;
    backtrack(1);
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: kienthuc24h.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on May 29 2022

Yucky Yak

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

backtrack

Contents

More Related Answers

backtrack

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.