Cod sursa(job #2813394)
Utilizator | Data | 6 decembrie 2021 15:47:12 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n,p, x[100];
ifstream cin ("combinari.in");
ofstream cout ("combinari.out");
void afis(){
for (int i = 1;i <n;++i)
cout << x[i] << " ";
cout << "\n";
}
void back(int k){
if (k == p+1)
afis();
else
for (int i = x[k-1] +1; i <=n +p - k;++i){
x[k] = i;
back(k+1);
}
}
int main(){
cin >>n >> p;
back(1);
}