Pagini recente » Cod sursa (job #1171801) | Cod sursa (job #1822173) | Cod sursa (job #3031001) | Cod sursa (job #1457823) | Cod sursa (job #916348)
Cod sursa(job #916348)
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int X[20], P[20];
int N, T;
void Write(int k)
{
for(int i = 1; i <= k; i++)
fout << X[i] << " ";
fout << '\n';
}
void Read()
{
fin >> N >> T;
}
bool Ok(int k)
{
if(k > 1 && X[k - 1] > X[k])
return false;
return true;
}
void Back(int k)
{
for(int i = X[k - 1] + 1; i <= N; i++)
if(!P[i])
{
P[i] = 1;
X[k] = i;
if(Ok(k) == true)
if(k == T)
Write(k);
else
Back(k + 1);
P[i] = 0;
}
}
int main()
{
Read();
Back(1);
fin.close();
fout.close();
return 0;
}