Pagini recente » Cod sursa (job #1671365) | Cod sursa (job #296298) | Cod sursa (job #1476361) | Cod sursa (job #866344) | Cod sursa (job #1872594)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, p, k, x[9], check[9];
void afis()
{
for(int i = 1; i <= n; ++i)
g<<x[i]<<' ';
g<<'\n';
}
void backt()
{
k++;
for(int i = x[k-1] + 1; i <= p; ++i)
{
x[k] = i;
if(check[i] == 0)
{
check[i] = 1;
if(k == n) afis();
else backt();
check[i] = 0;
}
}
k--;
}
int main()
{
f>>p>>n;
backt();
return 0;
}