Pagini recente » Cod sursa (job #3133803) | Cod sursa (job #1542171) | Cod sursa (job #3151836) | Cod sursa (job #1360001) | Cod sursa (job #1821904)
#include <cstdio>
using namespace std;
int n, k;
bool f[20];
int sol[20];
FILE *fin = fopen("combinari.in", "r"), *fout = fopen("combinari.out", "w");
void back(int l)
{
if(l == k )
{
for(int i = 1; i <= l ; i++)
fprintf(fout, "%d ", sol[i]);
fprintf(fout, "\n");
return;
}
for(int i = sol[l] + 1; i <= n; i++)
{
if(f[i] == 0)
{
sol[l + 1] = i;
f[i] = 1;
back(l + 1);
f[i] = 0;
}
}
}
int main()
{
fscanf(fin, "%d%d", &n, &k);
back(0);
return 0;
}