Cod sursa(job #1311586)
| Utilizator | Data | 8 ianuarie 2015 13:35:15 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <stdio.h>
using namespace std;
int n,k,st[100000];
void scriere()
{
for(int i=1;i<=k;i++)
printf("%d ",st[i]);
printf("\n");
}
bool valid(int p)
{
for(int i=1;i<p;i++)
{
if(st[i]>=st[i+1])
return 0;
}
return 1;
}
void back(int p)
{
for(int pval=1;pval<=n;pval++)
{
st[p]=pval;
if(valid(p))
{
if(p==k)
scriere();
else back(p+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(1);
return 0;
}
