Cod sursa(job #1427677)
Utilizator | Data | 2 mai 2015 20:35:58 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#define MaxN 20
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int N, v[MaxN];
void bk(int k) {
for (int i = v[k - 1] + 1; i <= N; ++i) {
v[k] = i;
for (int j = 1; j <= k; ++j)
fout << v[j] << ' ';
fout << '\n';
if (k < N)
bk(k + 1);
}
}
int main() {
fin >> N;
bk(1);
return 0;
}