Cod sursa(job #1833110)
| Utilizator | Data | 21 decembrie 2016 17:32:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int st[12],n,k;
void afisare ()
{
int i;
for(i=1; i<=k; i++)
fout<<st[i]<<" ";
fout<<"\n";
}
void backtrack(int niv)
{
int i;
if(niv==k+1)
{
afisare();
return;
}
for(i=st[niv-1]+1; i<=n; i++)
{
st[niv]=i;
backtrack(niv+1);
}
}
int main()
{
fin>>n>>k;
backtrack(1);
return 0;
}
