Pagini recente » Cod sursa (job #2668295) | Cod sursa (job #1096582) | Cod sursa (job #2846208) | Cod sursa (job #903180) | Cod sursa (job #154806)
Cod sursa(job #154806)
#include <cstdio>
#include <cstring>
int n, k, st[20], v[20];
char buffer[10000000];
int bufferi = 0;
#define p n
void back(int l)
{
int f = 1;
if(l < k)
{
for(int i = st[l]+1; i <= n; i++)
{
if(!v[i])
{
st[l+1] = i;
v[i] = 1;
back(l+1);
v[i] = 0;
}
}
}
else
{
for(int i = 1; i <= k; i++)
{
printf("%d ", st[i]);
// while(st[i])
// buffer[bufferi++] = st[i]+'0';
// buffer[bufferi++] = ' ';
}
// buffer[bufferi++] = '\n';
printf("\n");
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &k);
back(0);
// buffer[bufferi] = '\0';
// printf("%s", buffer);
return 0;
}