Pagini recente » Cod sursa (job #446183) | Cod sursa (job #1276241) | Cod sursa (job #534111) | Cod sursa (job #2487681) | Cod sursa (job #2698717)
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int x[10], n;
void Afis()
{
for (int j = 1; j <= n; j++)
fout << x[j] << " ";
fout << endl;
}
bool OK(int k) {
for (int i = 1; i < k; ++i)
if (x[k] == x[i])
return false;
return true;
}
void back(int k) {
if (k == n + 1)
{
for (int j = 1; j <= n; j++)
fout << x[j] << " ";
fout << endl;
}
else
for (int i = 1; i <= n; ++i)
{
x[k] = i;
if (OK(k))
back(k + 1);
}
}
int main() {
fin >> n;
back(1);
return 0;
}