Pagini recente » Cod sursa (job #2625295) | Cod sursa (job #1548773) | Cod sursa (job #2040008) | Cod sursa (job #1225457) | Cod sursa (job #1274183)
#include <fstream>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int v[20], i, j, k, n;
int ok, minim, maxim;
void solutie(int k){
for(int i = 1; i <= k; i ++)
fout << v[i] << " ";
fout << "\n";
}
int conditie(int k){
for(int i = 1; i < k; i ++)
if(v[i] == v[k] || v[k] < v[i])
return 0;
return 1;
}
void backtrack(int k){
if(k == n + 1)
return;
else{
for(int i = 1; i <= n; i ++){
v[k] = i;
if(conditie(k)){
solutie(k);
backtrack(k + 1);
}
}
}
return;
}
int main(){
fin >> n;
backtrack(1);
return 0;
}