Cod sursa(job #1820788)
Utilizator | Data | 2 decembrie 2016 11:18:18 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[20],fv[20],n,k;
void backtr(int niv)
{
int i;
if (niv==k+1)
{
for (i=1;i<=k;i++)
fout<<st[i]<<" ";
fout<<'\n';
}
else
{
for(i=st[niv-1]+1;i<=n;i++)
{
st[niv]=i;
backtr(niv+1);
}
}
}
int main()
{
fin>>n>>k;
backtr(1);
return 0;
}