Cod sursa(job #2129185)
Utilizator | Data | 12 februarie 2018 16:40:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,x[20];
void bkt(int);
int main()
{
f>>n>>k;
bkt(1);
return 0;
}
void bkt(int p)
{
if(p==k+1)
{
for(int i=1;i<=k;i++)
g<<x[i]<<' ';
g<<'\n';
return;
}
for(int i=x[p-1]+1;i<=n-k+p;i++)
{
x[p]=i;
bkt(p+1);
}
}