Pagini recente » Cod sursa (job #1937855) | Cod sursa (job #971975) | Cod sursa (job #2564999) | Cod sursa (job #400540) | Cod sursa (job #1417478)
#include<fstream>
using namespace std;
int n, m;
int v[20];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare(){
for(int i = 1; i <= m; i++){
fout<< v[i] <<" ";
}
fout<<"\n";
}
void back(int k){
if(k == m + 1){
afisare();
}
else{
for(int i = v[k - 1] + 1; i <= n; i++){
v[k] = i;
back(k + 1);
}
}
}
int main(){
fin>> n >> m;
back(1);
return 0;
}