Cod sursa(job #1949880)
Utilizator | Data | 2 aprilie 2017 14:49:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NMAX=20;
int n,k,v[NMAX];
void afisare()
{
int i;
for(i=1;i<=k;++i)
fout<<v[i]<<' ';
fout<<'\n';
}
void BKT(int j)
{
int i;
for(i=v[j-1]+1;i<=n-k+j;++i)
{
v[j]=i;
if(j==k)
afisare();
else
BKT(j+1);
}
}
int main()
{
fin>>n>>k;
BKT(1);
}