Cod sursa(job #2758114)
Utilizator | Mihnea Buzoiu mihnea_buzoiu | Data | 8 iunie 2021 17:46:17 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
//
// combinari.cpp
// probleme
//
// Created by Mihnea Buzoiu on 6/5/21.
//
#include <stdio.h>
#include <iostream>
using namespace std;
int v[11];
int n, k;
void print(){
for (int i=0; i<k; i++)
printf("%d ", v[i]);
printf("\n");
}
void f(int q, int lv){
for (int i=q+1; i<=n; i++){
v[lv] = i;
if (lv < k-1)
f(i, lv+1);
else print();
}
return;
}
int main(int argc, const char * argv[]) {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
f(0, 0);
}