Pagini recente » Cod sursa (job #743068) | Cod sursa (job #153902) | Cod sursa (job #3263239) | Cod sursa (job #200577) | Cod sursa (job #153567)
Cod sursa(job #153567)
#include <cstdio>
#include <vector>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector< vi > vii;
typedef vector<string> vs;
typedef vector<double> vd;
typedef pair<int, int> ii;
#define PB push_back
#define SZ(v) v.size()
#define ALL(v) (v).begin(), (v).end()
#define FORIT(i,c) for (typeof((c).end()) i=(c).begin(); i!=(c).end(); ++i)
#define FOR(i,n) for (int i = 0; i<(n); ++i)
#define FORE(i,n) for (int i = 0; i<=(n); ++i)
#define FORI(i,n1,n2) for (int i = n1; i<(n2); ++i)
#define FORIE(i,n1,n2) for (int i = n1; i<=(n2); ++i)
#define FORV(i,v) for (unsigned int i = 0; i<SZ(v); ++i)
#define INF 0x3f3f3f3f
#define EPS 1e-9
int N,K;
int A[20];
void back(int k)
{
if (k>K)
{
FORIE(i, 1, K)
printf("%d ", A[i]);
printf("\n");
return;
}
FORIE(i, A[k-1]+1, N)
{
A[k] = i;
back(k+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &N, &K);
back(1);
return 0;
}