Pagini recente » Cod sursa (job #1947906) | Cod sursa (job #2809110) | Cod sursa (job #1063883) | Cod sursa (job #2036465) | Cod sursa (job #1157252)
#include <cstdio>
using namespace std;
int n,m,sol[100];
void afisare()
{
for(int i=1;i<=m;i++)
{
printf("%d ",sol[i]);
}
printf("\n");
}
void back(int k)
{
if(k==m+1)
{
afisare();
return;
}
for(int i=sol[k-1]+1;i<=n-m+k;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}