Cod sursa(job #2646676)
| Utilizator | Data | 1 septembrie 2020 17:43:41 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define mod 666013
using namespace std;
ifstream fin ("submultimi.in");
ofstream fout ("submultimi.out");
const int DIM = 20 + 5;
int n, ans[DIM];
bool f[DIM];
void solve(int k)
{
for(int i = ans[k - 1] + 1; i <= n; ++i) {
if(f[i] == false) {
f[i] = true;
ans[k] = i;
for(int j = 1; j <= k; ++j) fout << ans[j] << " ";
fout << "\n";
if(k < n) solve(k + 1);
f[i] = false;
}
}
}
int main()
{
fin >> n;
solve(1);
return 0;
}
