Cod sursa(job #248248)
Utilizator | Data | 25 ianuarie 2009 12:01:30 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
int n,a[50],x;
int check (int k,int y)
{
if(a[k-1]>=y)
return 0;
return 1;
}
void back (int k)
{
int i;
if(k==n+1)
{
for(i=1;i<=n;++i)
printf("%d ",a[i]);
printf("\n");
}
else
{
for(i=1;i<=x;++i)
if(check(k,i)==1)
{
a[k]=i;
back(k+1);
}
}
}
int main ()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&x,&n);
back(1);
return 0;
}