Pagini recente » Cod sursa (job #857523) | Cod sursa (job #2156435) | Cod sursa (job #1841050) | Cod sursa (job #2647001) | Cod sursa (job #918772)
Cod sursa(job #918772)
#include <iostream>
#include <fstream>
using namespace std;
ofstream out("permutari.out");
ifstream in("permutari.in");
int s[19],n;
void scrie() {
int i;
for(i=1;i<=n;i++)
out<<s[i]<<" ";
out<<'\n';
}
int valid(int k) {
for(int i=1;i<k;i++)
if(s[i]==s[k]) return 0;
return 1;
}
void init(int k) {
s[k]=0;
}
void bkt(int k) {
if(k==n+1) scrie();
else {
init(k);
while(s[k]<n) {
s[k]++;
if(valid(k))
bkt(k+1);
}
}
}
int main()
{
in>>n;
bkt(1);
}