Pagini recente » Cod sursa (job #252341) | Cod sursa (job #620173) | Cod sursa (job #1435400) | Cod sursa (job #3174271) | Cod sursa (job #1729776)
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int B[20], v[20], k;
bool kappa(int n)
{
bool ok = false;
int c=0;
for(int i = 1; i <= n; ++i)
{
if(B[i] == 1)
{
c++;
}
}
if(c==k) ok = true;
return ok;
}
void submultimi(int n, int p)
{
if (p == n + 1)
{
if(kappa(n) == true)
{
for (int j = 1; j <= n; ++j)
{
if(B[j] == 1)
{
cout << v[j] << ' ';
}
}
cout << '\n';
}
return;
}
for (int i = 0; i <= 1; ++i)
{
B[p] = i;
submultimi(n, p + 1);
}
}
int main()
{
int n;
cin >> n >> k;
for(int i = 1; i <= n; ++i)
{
v[i] = i;
}
submultimi (n, 1);
return 0;
}