Pagini recente » Cod sursa (job #2979483) | Cod sursa (job #566060) | Cod sursa (job #2367703) | Cod sursa (job #2039977) | Cod sursa (job #1320349)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, p, x[20];
void Back(int k);
void Write(int k);
int main()
{
fin >> n >> p;
Back(1);
fin.close();
fout.close();
}
void Back(int k)
{
if ( k > p )
{
Write(k - 1);
return;
}
for ( int i = x[k - 1] + 1; i <= n - p + k; i++ )
{
x[k] = i;
Back(k + 1);
}
}
void Write(int k)
{
for ( int i = 1; i <= k; i++ )
fout << x[i] << ' ';
fout << '\n';
}