Cod sursa(job #3359267)
| Utilizator | Data | 26 iunie 2026 13:35:57 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,x[19];
void Afisare(){
for(int i=1;i<=m;i++)
g<<x[i]<< ' ';
g<<'\n';
}
void Back(int k){
if(k<=m)
for(int i=x[k-1]+1;i<=n-m+k;i++){
x[k]=i;
Back(k+1);
}
else Afisare();
}
int main()
{
f>>n>>m;
Back(1);
f.close();
g.close();
return 0;
}
