Pagini recente » Cod sursa (job #2667309) | Cod sursa (job #399574) | Cod sursa (job #619410) | Cod sursa (job #2945865) | Cod sursa (job #351061)
Cod sursa(job #351061)
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int a[20], n, k;
void print ()
{
for (int i=1; i<=k; ++i)
out<<a[i]<<' ';
out<<'\n';
}
void bt (int i)
{
if (i<1) return;
if (i>k) { print (); i--; }
if (a[i]<a[i-1]) a[i]=a[i-1]+1;
else a[i]++;
if (a[i]>n) { a[i]=0; bt (i-1); }
else bt (i+1);
}
int main ()
{
in>>n>>k; bt (1);
return 0;
}