Cod sursa(job #3321538)
| Utilizator | Data | 9 noiembrie 2025 23:52:44 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int n, m, v[21];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void Afisare()
{
for(int i=1; i<=m; ++i)
fout<< v[i] << ' ';
fout<< '\n';
}
void Back(int k)
{
for(int i=v[k-1]+1; i<=n; ++i)
{
v[k]=i;
if(k==1)
{
if(k==m)Afisare();
else Back(k+1);
}
}
}
int main()
{
fin >> n >> m;
Back(1);
fin.close();
fout.close();
return 0;
}
