Cod sursa(job #1681019)
| Utilizator | Data | 9 aprilie 2016 11:10:15 | |
|---|---|---|---|
| Problema | Componente tare conexe | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <stack>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int S[20], fi, V[20];
int n, k;
void bkt(int last)
{
int i;
if (fi==k)
{
for (i=1; i<=k; i++)
fout<<S[i]<<" ";
fout<<'\n';
}
else
for (i=last+1; i<=n; i++)
{
if (V[i]==0)
{
S[++fi]=i;
V[i]=1;
bkt(i);
V[i]=0;
S[fi--]=i;
}
}
}
int main()
{
fin>>n>>k;
bkt(0);
return 0;
}
