Pagini recente » Cod sursa (job #2067527) | Cod sursa (job #2793503) | round_3 | Cod sursa (job #1364762) | Cod sursa (job #918818)
Cod sursa(job #918818)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n, s[100];
void scrie() {
for (int 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 () {
bkt (1);
}