Pagini recente » Cod sursa (job #2940780) | Cod sursa (job #2120726) | Cod sursa (job #2218752) | Cod sursa (job #1364266) | Cod sursa (job #3000409)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n , lg , a[1999999];
void afis()
{
for ( int i = 1 ; i <= lg ; i++)
g << a[i] << " ";
g << '\n';
}
bool verif(int poz)
{
for ( int i = 1 ; i < poz ; i++)
{
if(a[i] >= a[poz])
return false;
}
return true;
}
void bkt(int k)
{
for(int i = 1 ; i <= n ; i++)
{
a[k] = i;
if(verif(k) == true)
if(k == lg)
afis();
else
bkt(k + 1);
}
}
int main()
{
f >> n >> lg;
bkt(1);
return 0;
}