Cod sursa(job #3359801)
| Utilizator | Data | 4 iulie 2026 12:15:50 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, v[21], k1;
void bkt(int k)
{
int i;
for(i=v[k-1]+1; i<=n; i++)
{
v[k]=i;
if(k==k1)
{
for(int j=1; j<=k1; j++)
fout<<v[j]<<" ";
fout<<'\n';
}
else if(k<k1)
bkt(k+1);
}
}
int main()
{
fin>>n>>k1;
bkt(1);
return 0;
}
