Pagini recente » Istoria paginii utilizator/alias47 | Cod sursa (job #3361317) | Cod sursa (job #3361240)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ft(n) for(int i=1; i<=n; i++)
#define sp ' '
string file = "combinari";
ifstream f(file + ".in");
ofstream g(file + ".out");
int n, p;
vector<int> v(10);
void write()
{
for (int i = 1; i <= p; i++)
g << v[i] << sp;
g << "\n";
}
int chk(int k)
{
for (int i = 1; i < k; i++)
if (v[k] <= v[i])
return 0;
return 1;
}
void bkt(int k)
{
for (int i = 1; i <= n; i++)
{
v[k] = i;
if (chk(k))
if (k == p)
write();
else
bkt(k + 1);
}
}
int main()
{
f >> n >> p;
bkt(1);
return 0;
}