Pagini recente » Cod sursa (job #3280763) | Cod sursa (job #2949700) | Cod sursa (job #3292283) | Cod sursa (job #1961365) | Cod sursa (job #1698735)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int N,i[10],m[10];
void back(int niv){
if(niv>N){
for(int j=1;j<=N;j++) out<<i[j]<<' ';
out<<'\n';
return;
}
for(i[niv]=1;i[niv]<=N;i[niv]++){
if(m[i[niv]]==0){
m[i[niv]]=1;
back(niv+1);
m[i[niv]]=0;
}
}
}
int main(){
in>>N;
back(1);
return 0;
}