Cod sursa(job #1984896)
| Utilizator | Data | 26 mai 2017 14:48:00 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int k,n,v[20];
bool viz[20];
inline void bk(int l,int start)
{
int i;
for(i=start;i<=n;i++)
{
if(!viz[i])
{
viz[i]=1;
v[l]=i;
if(l==k)
{
int j;
for(j=1;j<=k;j++)
printf("%d ",v[j]);
printf("\n");
}
else
bk(l+1,i+1);
viz[i]=0;
}
}
return;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int i;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
v[i]=i;
bk(1,1);
}
