Cod sursa(job #597464)
| Utilizator | Data | 22 iunie 2011 12:45:38 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <stdio.h>
int n,k,st[19],ok[19],okk;
int validare (void)
{
int i;
okk=1;
for (i=2; i<=k && okk; i++) if (st[i]<=st[i-1]) okk=0;
return okk;
}
int back (int p)
{
int i;
if (p==k)
{
if (validare())
{
for (i=1; i<=k; i++) printf("%d ", st[i]);
printf("\n");
}
}
else for (i=st[p]+1; i<=n; i++)
{
st[p+1]=i;
back(p+1);
}
}
int main () {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n,&k);
back(0);
return 0;
}