Cod sursa(job #3145657)
Utilizator | Data | 16 august 2023 16:11:46 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,p,x[19];
void afis(){
for(int i=1;i<=p;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
void Back(int k){
for(int i=1;i<=n;i++){
x[k]=i;
if(k==1||x[k]>x[k-1]){
if(k==p)
afis();
else Back(k+1);
}
}
}
int main(){
fin>>n>>p;
Back(1);
}