Pagini recente » Cod sursa (job #2794321) | Cod sursa (job #2628656) | Cod sursa (job #2395121) | Cod sursa (job #1048802) | Cod sursa (job #2481536)
#include<fstream>
using namespace std;
int x[50], n, p;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
void print ( int k)
{
for( int i = 1; i <= k; i ++)
out << x[i] << " ";
out << '\n';
}
void bkt ( int k )
{
if (k == p + 1)
print (p);
for(int i = x[k-1] + 1;i <= n; i ++) {
x[k] = i;
bkt(k + 1);
}
}
int main ()
{
in >> n >> p;
bkt (1);
return 0;
}