Pagini recente » Cod sursa (job #1220221) | Cod sursa (job #3275153) | Cod sursa (job #2686111) | Cod sursa (job #1165531) | Cod sursa (job #3244615)
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n, c, s[20];
void afis()
{
for(int i=1; i<=c; i++)
cout << s[i] << " ";
cout << '\n';
}
bool valid(int k)
{
for(int i=1; i<=k-1; i++)
if(s[i] == s[k])
return 0;
return 1;
}
void bkt(int k)
{
for(int i=s[k-1]+1; i<=n; i++)
{
s[k] = i;
if(valid(k))
if(k == c)
afis();
else
bkt(k+1);
}
}
int main()
{
cin >> n >> c;
bkt(1);
return 0;
}