Cod sursa(job #2224095)
Utilizator | Basso Nicolae prime | Data | 22 iulie 2018 20:47:28 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int s[11], n, k;
void back(int k){
int i, j;
bool ok;
if(k == n){
for(i = 1; i <= n; i++)
out << s[i] << " ";
out << "\n";
}
else{
for(i = 1; i <= n; i++){
ok = true;
for(j = 1; j <= k; j++)
if(s[j] == i){
ok = false;
break;
}
if(ok){
s[k + 1] = i;
back(k + 1);
}
}
}
}
int main(){
in >> n;
back(0);
return 0;
}