Pagini recente » Cod sursa (job #1946527) | Cod sursa (job #3278039) | Cod sursa (job #2720613) | Cod sursa (job #2919994) | Cod sursa (job #3273796)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[20], n, p;
void Afis(int k)
{
for(int j = 1 ; j <= k ; j ++)
fout << x[j] << " ";
fout << "\n";
}
bool OK(int k)
{
for(int i = 1 ; i < k ; ++ i)
if(x[k] == x[i])
return 0;
if(k > 1)
if(x[k] <= x[k-1])
return 0;
return 1;
}
bool Solutie(int k)
{
return k == p;
}
void back(int k)
{
for(int i = 1 ; i <= n ; ++ i)
{
x[k] = i;
if(OK(k))
if(Solutie(k))
Afis(k);
else
back(k + 1);
}
}
int main()
{
fin >> n >> p;
back(1);
return 0;
}