Pagini recente » Cod sursa (job #1858824) | Cod sursa (job #1861396) | Cod sursa (job #464759) | Cod sursa (job #1521963) | Cod sursa (job #1374717)
#include <fstream>
#define IN "combinari.in"
#define OUT "combinari.out"
using namespace std;
ifstream fin(IN);
ofstream fout(OUT);
void rec(int k);
void afiseaza();
int n, p;
bool use[101];
int sol[101];
int main()
{
fin >> n >> p;
rec(1);
fout.close();
return 0;
}
void rec(int k)
{
int i;
if(k == p+1)
afiseaza();
else
{
for(i = sol[k-1] + 1; i <= n; ++i)
if(use[i] == false)
{
use[i] = true;
sol[k] = i;
rec(k+1);
use[i] = false;
}
}
}
void afiseaza()
{
int i;
for(i = 1; i <= p; ++i)
fout << sol[i] << ' ';
fout << '\n';
}