Pagini recente » Cod sursa (job #2621063) | Cod sursa (job #2398249) | Cod sursa (job #256652) | Cod sursa (job #1788367) | Cod sursa (job #2722951)
#include <fstream>
#define N 10
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n;
bool fol[N];
int perm[N];
void permutari(int k){
if(k == n + 1){
for(int i = 1; i <= n; ++i)
out<<perm[i]<<" ";
out<<'\n';
}
for(int j = 1; j <= n; ++j)
if(!fol[j]){
perm[k] = j;
fol[j] = 1;
permutari(k + 1);
fol[j] = 0;
}
}
int main()
{
in>>n;
permutari(1);
in.close();
out.close();
return 0;
}