Cod sursa(job #3294435)
Utilizator | Data | 23 aprilie 2025 14:18:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
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 bt(int k){
if(k<=M){
for(int i=v[k-1]+1;i<=N-M+k;i++){
v[k]=i;
bt(k+1);
}
}else afisare();
}
int main()
{
f >> N >> M;
bt(1);
f.close();
g.close();
return 0;
}