Pagini recente » Cod sursa (job #674733) | Cod sursa (job #1850645) | Cod sursa (job #3172356) | Istoria paginii home | Cod sursa (job #2013411)
#include <bits/stdc++.h>
using namespace std;
FILE *F=fopen("combinari.in", "r"), *G=fopen("combinari.out", "w");
int n, k, st[20], fr[20];
void bck(int niv)
{
if(niv-1 == k)
{
for(int i = 1; i <= k; ++ i)
fprintf(G, "%d ", st[i]);
fputc('\n', G);
return;
}
for(int i = st[niv-1]+1; i <= n; ++ i)
if(!fr[i])
{
fr[i] = 1;
st[niv] = i;
bck(niv+1);
fr[i] = 0;
}
}
int main()
{
fscanf(F, "%d %d ", &n, &k);
bck(1);
return 0;
}