Cod sursa(job #3183519)
Utilizator | Alexia Tanaseanu tanaseanualexia | Data | 12 decembrie 2023 09:51:58 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x[10] , n , p, uz[10];
ofstream outputFile("permutari.out");
void Afis(int k)
{
for(int j = 1 ; j <= k ; j ++)
outputFile << x[j] << " ";
outputFile << endl;
}
void back(int k){
for(int i = 1 ; i <= n ; ++ i)
if(uz[i] == 0)
{
x[k] = i;
uz[i] = 1;
if(k == n)
Afis(k);
else
back(k + 1);
uz[i] = 0;
}
}
int main() {
ifstream fin("permutari.in");
fin >> n;
back(1);
outputFile.close();
}