Pagini recente » Cod sursa (job #2722535) | Cod sursa (job #1077558) | Cod sursa (job #1074251) | Cod sursa (job #3138471) | Cod sursa (job #2558074)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, i, x[20];
void afisare()
{
int i;
for(i=1; i<=k; i++)
fout << x[i] << " ";
fout << "\n";
}
int ok(int p)
{
if(x[p]<=x[p-1]) return 0;
return 1;
}
void bkt()
{
i=1;
while(i!=0)
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else
if(ok(i))
{
i++;
if(i>k){i=k; afisare();}
}
}
}
int main()
{
fin >> n >> k;
bkt();
return 0;
}