Pagini recente » Borderou de evaluare (job #982637) | Cod sursa (job #874478) | Borderou de evaluare (job #451804) | Borderou de evaluare (job #1737563) | Cod sursa (job #2412271)
#include <cstdio>
using namespace std;
int n,k,sol[100];
bool verif(int x)
{
for(int i=2; i<=x; i++)
if(sol[i]<=sol[i-1])
return false;
return true;
}
void BK(int x)
{
if(x<=k)
{
for(int i=x; i<=n-k+x; i++)
{
sol[x]=i;
if(verif(x))
{
if(x==k)
{
for(int j=1; j<=k; j++)
printf("%d ",sol[j]);
printf("\n");
}
else
BK(x+1);
}
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
BK(1);
return 0;
}