Pagini recente » Cod sursa (job #2147106) | Cod sursa (job #582692) | Cod sursa (job #2008427) | Cod sursa (job #1755174) | Cod sursa (job #1104254)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n,k,st[9];
void w(){
for (int j=1; j<=n; j++)
out << st[j] << " ";
out << endl;
}
bool check(int k){
for (int i=1; i<k; i++)
if (st[i]==st[k]) return false;
return true;
}
void back(int k){
for (int i=1; i<=n; i++){
st[k]=i;
if (check(k)){
if (k==n) w();
else back(k+1);
}
}
}
int main(){
in >> n;
back(1);
return 0;
}