Cod sursa(job #3309334)
| Utilizator | Data | 3 septembrie 2025 17:38:04 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
int a[20];
void bkt(int pas, int start)
{
if(pas == m + 1)
{
for(int i = 1; i <= n; i++)
{
fout << a[i] << " ";
}
fout << "\n";
}
else{
for(int i = start; i <= n; i++)
{
a[pas] = i;
bkt(pas + 1, i + 1);
}
}
}
int main()
{
fin >> n >> m;
bkt(1, 1);
return 0;
}