Cod sursa(job #1698735)
Utilizator | Data | 5 mai 2016 10:40:46 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#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;
}