Pagini recente » Cod sursa (job #3134725) | Istoria paginii runda/rar13/clasament | Borderou de evaluare (job #2126189) | Cod sursa (job #2519914) | Cod sursa (job #3227645)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#define x first
#define y second
#define ll long long
#define pb push_back
#define bg begin()
#define ed end()
#define cl clear()
#define pii pair<int, int>
#define int ll
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
const int MOD = 123457;
const char nl = '\n';
const int NMAX = 4e6 + 5;
const int INF = 1e9;
int n, v[20];
void bkt(int k){
for(int i = v[k - 1] + 1; i <= n; ++i){
v[k] = i;
for(int j = 1; j <= k; ++j){
out << v[j] << ' ';
}
out << nl;
bkt(k + 1);
}
}
signed main()
{
in >> n;
bkt(1);
return 0;
}