Cod sursa(job #1155149)
Utilizator | Data | 26 martie 2014 18:11:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int v[30],n,pac;
bool fol[30];
void bk(int k);
void scrie(int k);
int main()
{
cin>>n>>pac;
bk(1);
}
void bk(int k)
{
int i;
for(i=v[k-1]+1; i<=n; i++)
{
if(!fol[i])
{
fol[i]=1;
v[k]=i;
if(k==pac)
scrie(k);
else
if(k<pac)
bk(k+1);
fol[i]=0;
}
}
}
void scrie(int k)
{
for(int i=1; i<=k; i++)
cout<<v[i]<<" ";
cout<<"\n";
}