Cod sursa(job #2804538)
Utilizator | Data | 21 noiembrie 2021 11:38:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
#define link pair<int, int>
#define x first
#define y second
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m;
int comb[20];
void back(int k)
{
if(k == m + 1)
{
for(int i = 1;i <= m;++i)
g<<comb[i]<<" ";
g<<'\n';
return;
}
for(int i = comb[k - 1] + 1;i <= n;++i)
{
comb[k] = i;
back(k + 1);
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}