Cod sursa(job #3307586)
| Utilizator | Data | 21 august 2025 20:22:51 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m;
int v[25];
void bk(int k)
{
for(int i=1;i<=n;++i)
{
if(i>v[k-1])
{
v[k]=i;
if(k==m)
{
for(int h=1;h<=m;++h)
{
fout<<v[h]<<" ";
}
fout<<"\n";
}
else
{
bk(k+1);
}
}
}
}
int main()
{
fin>>n>>m;
bk(1);
return 0;
}
