Pagini recente » Cod sursa (job #3161929) | Cod sursa (job #1979870) | Cod sursa (job #902861) | Cod sursa (job #1939191) | Cod sursa (job #1095828)
#include <iostream>
#include <fstream>
using namespace std;
int a[18], n, p;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void Afisare()
{
for(int i = 1; i<= p; i++)
fout<<a[i]<<" ";
fout<<"\n";
}
int Continuare(int k)
{
for(int i = 1; i<=n-p+1; i++)
if(k>1 && a[k]<= a[k-1]) return 0;
return 1;
}
void Back(int k)
{
if(k == p+1) Afisare();
else
for(int i = 1; i<=n ;i++)
{
a[k] = i;
if(Continuare(k)) Back(k+1);
}
}
int main()
{
fin>>n>>p;
Back(1);
return 0;
}