Cod sursa(job #1853333)
Utilizator | Eduard Turtoi eduardturtoi | Data | 21 ianuarie 2017 17:41:58 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#define nmax 19
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[nmax],n,k;
int valid(int p)
{
int i;
for(i=1;i<p;i++)
if(st[p]==st[i])
return 0;
return 1;
}
int solutie(int p)
{
return p==k;
}
void afis(int p)
{
int i;
for(i=1;i<=p;i++)
fout<<st[i]<<" ";
fout<<'\n';
}
void bk(int p)
{
int i;
for(i=st[p-1]+1;i<=n;i++)
{
st[p]=i;
if(valid(p))
{
if(solutie(p))
afis(p);
else
bk(p+1);
}
}
}
int main()
{
fin>>n>>k;
bk(1);
return 0;
}