Pagini recente » Cod sursa (job #2147921) | Cod sursa (job #2157847) | Cod sursa (job #2767984) | Cod sursa (job #1105748) | Cod sursa (job #1686797)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, p, st[10], cl;
void back(int k)
{
bool ok;
int i,j;
if(k == cl)
{
for(i = 1; i <= cl; i++) fout << st[i] << " ";
fout << "\n";
}
else
{
for(i = 1; i <= n; i++)
{
ok = true;
for(j = 1; j <= k; j++)
if(st[j] == i)
{
ok = false;
break;
}
if(ok)
{
st[k+1] = i;
back(k+1);
}
}
}
}
int main()
{
fin >> n >> cl;
back(0);
return 0;
}