Cod sursa(job #3286237)
Utilizator | Data | 13 martie 2025 20:57:39 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,v[20];
void afisare(){
for(int i=1; i<=m; i++)
g<<v[i]<<' '; g<<'\n';
}
void backt(int k)
{
if(k==m+1)
afisare();
else
for(int i=v[k-1]+1; i<=n; i++)
v[k]=i, backt(k+1);
}
int32_t main()
{
f>>n>>m, backt(1);
return 0;
}