Cod sursa(job #1072367)
| Utilizator | Data | 4 ianuarie 2014 13:13:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <stdio.h>
using namespace std;
unsigned n,k,st[20];
void afiseaza()
{
for(unsigned i=1;i<=k;i++)
printf("%u ",st[i]);
printf("\n");
}
unsigned verifica(unsigned p)
{
if(p>1)
{
if(st[p]<=st[p-1])
return 0;
}
return 1;
}
void back(unsigned p)
{
unsigned i;
for(i=1;i<=n;i++)
{
st[p]=i;
if(verifica(p))
{
if(p==k)
afiseaza();
else
back(p+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%u %u",&n,&k);
back(1);
return 0;
}
