Pagini recente » Cod sursa (job #780020) | Cod sursa (job #2985096) | Cod sursa (job #2483283) | Cod sursa (job #2092863) | Cod sursa (job #2282014)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[1000],m;
int verificare(int k){
for(int i=1;i<k;i++){
if(v[k-1]>=v[k]&&k>1){
return 0;
}
}
return 1;
}
void backtr(int k){
if(k>m){
for(int i=1;i<=m;i++){
fout<<v[i]<<" ";
}
fout<<"\n";
}
else{
for(int i=1;i<=n;i++){
v[k]=i;
if(verificare(k)==1){
backtr(k+1);
}
}
}
}
int main(){
fin>>n>>m;
backtr(1);
}