Cod sursa(job #1829734)
| Utilizator | Data | 15 decembrie 2016 16:27:03 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <cstdio>
#define KMAX 18
using namespace std;
int N,K;
int comb[KMAX];
void afisare()
{
for(int i=1;i<=K;i++)
cout<<comb[i]<<" ";
cout<<"\n";
}
void btr(int pas)
{
if(pas>K)
afisare();
else
{
for(int i=comb[pas-1]+1;i<=N-K+pas;i++)
{
comb[pas]=i;
btr(pas+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
cin>>N>>K;
btr(1);
return 0;
}
