Pagini recente » Cod sursa (job #2760012) | Cod sursa (job #1361133) | Cod sursa (job #917163) | Cod sursa (job #2352398) | Cod sursa (job #2744960)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
string NumeFisier = "combinari";
ifstream fin(NumeFisier + ".in");
ofstream fout(NumeFisier + ".out");
typedef unsigned long long int ull;
int n, k,sol[20];
void print()
{
for (int i = 1; i <= k; i++)
fout << sol[i] << ' ';
fout << '\n';
}
bool check(int poz)
{
if (poz == 1)
return 1;
if (sol[poz - 1] >= sol[poz])
return 0;
return 1;
}
void back(int poz)
{
if (poz == k + 1)
print();
else
for (int i = 1; i <= n; i++)
{
sol[poz] = i;
if (check(poz))
back(poz + 1);
}
}
int main()
{
fin >> n >> k;
back(1);
}