Cod sursa(job #796888)
Utilizator | Data | 12 octombrie 2012 20:59:11 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<cstdio>
using namespace std;
int x[19],n,k;
bool bun(int a)
{
for(int i=1;i<a;i++)
if(x[i]==x[a]||x[i]>x[a])
return 0;
return 1;
}
void afiseaza()
{
//freopen("combinari.out","w",stdout);
for(int i=1;i<=k;i++)
printf("%d ",x[i]);
printf("\n");
}
void back(int i)
{
if(i>k)
{
afiseaza();return;
}
for(int j=1;j<=n;j++)
{
x[i]=j;
if(bun(i))
back(i+1);
}
}
int main()
{
//freopen("combinari.in","r",stdin);
scanf("%d%d",&n,&k);
back(1);
}