Pagini recente » Cod sursa (job #1286162) | Cod sursa (job #2787366) | Cod sursa (job #2344115) | Cod sursa (job #2802576) | Cod sursa (job #1688247)
#include <fstream>
#define NMAX 20
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int i, n, v[NMAX], level = 1, m, fr[NMAX];
void afisare()
{
for (int i = 1; i <= m; ++ i)
g << v[i] << " " ;
g << '\n';
}
bool check()
{
for (int i = 1; i <= n; ++ i)
fr[i] = 0;
for (i = 1; i <= n; ++ i)
{
fr[v[i]] ++;
if (fr[v[i]] > 1)
return 0;
}
return 1;
}
void backtracking()
{
while (level)
{
bool ok = 0;
while (v[level] < n && !ok)
{
v[level] ++;
ok = check;
}
if (!ok)
level --;
else
if (ok && level == m)
afisare();
else
if (ok)
v[++ level] = v[level - 1];
}
}
int main()
{
f >> n >> m;
backtracking();
return 0;
}