Cod sursa(job #521135)
Utilizator | Data | 11 ianuarie 2011 14:14:59 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
int n,k,sol[19];
ifstream in("combinari.in");
ofstream out("combinari.out");
void prelucrare()
{
for(int i=1;i<=k;i++)
out<<sol[i]<<' ';
out<<'\n';
}
bool valid(int p)
{
/*
for(int i=1;i<p;i++)
if(sol[i]==sol[p])
return false;
*/
if(sol[p-1]>=sol[p])
return false;
return true;
}
void bkt(int p)
{
if(p==k+1)
{
prelucrare();
return;
}
for(int i=1;i<=n;i++)
{
sol[p]=i;
if(valid(p))
bkt(p+1);
}
}
int main()
{
in>>n>>k;
bkt(1);
return 0;
}