Pagini recente » Arhiva de probleme | Cod sursa (job #495943) | Cod sursa (job #1682721) | Cod sursa (job #172479) | Cod sursa (job #577868)
Cod sursa(job #577868)
#include <stdio.h>
using namespace std;
int n;
int m;
int a[20];
int viz[20];
void back(int k)
{
if(k==m+1)
{
for(int i=1;i<=m;i++)
printf("%d ",a[i]);
printf("\n");
}
for(int i=a[k-1]+1;i<=n;i++)
{
a[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;
}