Cod sursa(job #471753)
Utilizator | Data | 20 iulie 2010 16:45:04 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,sol[20];
void citire()
{
in>>n>>k;
}
bool valid(int p)
{
for(int i=1;i<p;i++)
if(sol[i]==sol[p])
return false;
return true;
}
void afisare()
{
for(int i=1;i<=k;i++)
out<<sol[i]<<" ";
out<<'\n';
}
void bk(int p)
{
if(p>n)
{
afisare();
return ;
}
for(int i=1;i<=n;i++)
{
sol[p]=i;
if(valid(p))
bk(p+1);
}
}
int main()
{
citire();
bk(1);
return 0;
}