Cod sursa(job #2860735)
Utilizator | Data | 3 martie 2022 00:17:56 | |
---|---|---|---|
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,k,pos,x[20];
void afis(){
for(int i=1;i<=k;i++)
g<<x[i]<<" ";
g<<'\n';
}
void backt(int pos){
if(pos==k+1)
afis();
else{
for(int i=x[pos-1]+1;i<=n;i++){
x[pos]=i;
backt(pos+1);
}
}
}
int main()
{
f>>n>>k;
x[0]=0;
backt(1);
return 0;
}