Cod sursa(job #1901332)
Utilizator | Data | 3 martie 2017 21:16:50 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, s[20], frecv[20];
void bk(int poz)
{
if(poz == k+1)
{
for(int i=1; i<=k; i++)
fout<<s[i]<<' ';
fout<<'\n';
return;
}
for(int i=s[poz-1] + 1; i<=n; i++)
{
if(!frecv[i])
{
s[poz] = i;
frecv[i] = 1;
bk(poz+1);
s[poz] = 0;
frecv[i] = 0;
}
}
}
int main()
{
fin >> n >> k;
bk(1);
return 0;
}