Cod sursa(job #1180591)
| Utilizator | Data | 30 aprilie 2014 19:55:27 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int Stack[24],N;
void backtracking() {
int i;
for(i=1;i<=Stack[0];i++)
out<<Stack[i]<<' ';
if(Stack[0])
out<<'\n';
for(i=Stack[Stack[0]]+1;i<=N;i++){
Stack[++Stack[0]]=i;
backtracking();
Stack[Stack[0]]=0;
Stack[0]--;
}
}
int main() {
in>>N;
backtracking();
return 0;
}
