Pagini recente » Cod sursa (job #2537170) | Borderou de evaluare (job #204147) | Cod sursa (job #879975)
Cod sursa(job #879975)
#include<fstream>
#define dmax 20
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k, stack[dmax];
void comb(int id)
{
if(id == k+1)
{
for(int i=1; i<=k; i++)
out<<stack[i]<<" ";
out<<'\n';
}
else
{
for(int i=stack[id-1]+1; i <= n; i++)
{
stack[id] = i;
comb(id+1);
}
}
}
int main()
{
in>>n>>k;
in.close();
comb(1);
out.close();
return 0;
}