Cod sursa(job #1939024)
| Utilizator | Data | 25 martie 2017 13:24:15 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,vf[20],nr;
void backt(int st, int nr)
{
if(st==k)
{
for(int i=1; i<=n; i++) if(vf[i]) out<<i<<" ";
out<<'\n';
}
else
{
for(int i=nr; i<=n; i++)
{
if(!vf[i])
{
vf[i]=1; st++;
backt(st,i+1);
vf[i]=0; st--;
}
}
}
}
int main()
{
in>>n>>k;
backt(0,1);
return 0;
}
