Pagini recente » Cod sursa (job #2653848) | Cod sursa (job #2503795) | Cod sursa (job #2112594) | Cod sursa (job #2329598) | Cod sursa (job #2151616)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,p,v[20];
bool valid(int k)
{
for (int i=1; i<k; ++i)
{
if (v[i]>=v[k]) return 0;
}
return 1;
}
void afisare(int k)
{
for (int i=1; i<=k; ++i) fout << v[i] << " ";
fout << "\n";
}
void back(int k)
{
for (int i=1; i<=n; ++i)
{
v[k]=i;
if (valid(k))
{
if (k<p) back(k+1);
else afisare(k);
}
}
}
int main()
{
fin >> n >> p;
back(1);
return 0;
}