Pagini recente » Cod sursa (job #1934831) | Monitorul de evaluare | Cod sursa (job #936376) | Cod sursa (job #1231101) | Cod sursa (job #604727)
Cod sursa(job #604727)
#include<cstdio>
using namespace std;
FILE *fin, *fout;
int st[19], n, p;
void back (int k)
{
if (k == p + 1)
{
for(int i = 1; i <= p; i++)
fprintf (fout, "%d ", st[i]);
fprintf (fout, "\n");
}
else
{
for (int i = st[k-1] + 1; i <= n - p + k; i++)
{
st[k] = i;
back (k + 1);
}
}
}
int main()
{
fin = fopen ("combinari.in", "r");
fout = fopen ("combinari.out", "w");
fscanf (fin, "%d %d", &n, &p);
back (1);
fclose (fin); fclose (fout);
return 0;
}