Pagini recente » Cod sursa (job #621998) | Cod sursa (job #1802054) | Cod sursa (job #3230153) | Cod sursa (job #612690) | Cod sursa (job #2569687)
#include <fstream>
std::ifstream f("submultimi.in");
std::ofstream g("submultimi.out");
int n,a[20];
bool fr[20];
void printSol(int k){
for(int i = 1;i <= k;++i)
g << a[i] << ' ';
g << '\n';
}
void back(int k){
for(int i = 1;i <= n;++i){
a[k] = i;
if(!fr[a[k]] && (k == 1 || a[k] > a[k - 1])){
fr[a[k]] = 1;
printSol(k);
if(k < n)
back(k + 1);
fr[a[k]] = 0;
}
}
}
int main(){
f >> n;
back(1);
return 0;
}