Cod sursa(job #2955803)
Utilizator | Bianca Ivascu biancaivascu | Data | 17 decembrie 2022 20:29:53 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
#define MaxN 18
int v[MaxN];
void comb(int pos, int n, int k)
{
int i;
if(pos==k+1)
{
for(i=1; i<=k; i++)
out<<v[i]<<" ";
out<<'\n';
}
else
{
for(i=v[pos-1]+1; i<=n; i++)
{
v[pos]=i;
comb(pos+1, n, k);
}
}
}
int main()
{
int n, k;
in>>n>>k;
comb(1, n, k);
return 0;
}