Pagini recente » Cod sursa (job #2706467) | Cod sursa (job #509265) | Cod sursa (job #2947867) | Cod sursa (job #976621) | Cod sursa (job #274595)
Cod sursa(job #274595)
#include <stdio.h>
int n,p[20],uz[20],m;
void afis()
{
long i;
for (i=1;i<=m;++i)
printf("%d ",p[i]);
printf("\n");
}
void back(long k)
{
long i;
if (k==m+1)
afis();
else
for (i=p[k-1]+1;i<=n;++i)
if (!uz[i])
{
uz[i]=1;
p[k]=i;
back(k+1);
uz[i]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back(1);
return 0;
}