Pagini recente » Cod sursa (job #2266278) | Cod sursa (job #1541783) | Cod sursa (job #813857) | Cod sursa (job #2262347) | Cod sursa (job #1689343)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,t[10];
bool ok;
void backtr(int k){
if(k == n+1){
for(int i=1;i<=n;i++){
g<<t[i]<<" ";
}
g<<endl;
}
else{
for(int i=1;i<=n;i++){
ok = true;
for(int j=1;j<=k;j++){
if(t[j]==i){
ok=false;
break;
}
}
if(ok){
t[k+1]=i;
backtr(k+1);
}
}
}
}
int main()
{
f>>n;
backtr(0);
return 0;
}