Cod sursa(job #2174554)
Utilizator | Data | 16 martie 2018 12:33:29 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, st[20];
void bk(int p)
{
if(p==k+1) {
for(int i=1; i<=k; i++)
fout<<st[i]<<' ';
fout<<'\n';
}
else
for(int i=st[p-1]+1; i<=n-k+p; i++) {
st[p]=i;
bk(p+1);
}
}
int main()
{
fin>>n>>k;
bk(1);
return 0;
}