Pagini recente » Cod sursa (job #1978385) | Cod sursa (job #2379395) | Cod sursa (job #1779759) | Cod sursa (job #2128694) | Cod sursa (job #2409525)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m;
int st[20];
void tipar(){
int i;
for(i = 1 ; i <= m ; i++){
g << st[i] << " ";
}
g << "\n";
}
bool valid (int k){
int i;
for(i = 1 ; i < k ; i++)
if(st[i] == st[k] || st[i] > st[i + 1])
return 0;
return 1;
}
void back(){
int k = 1;
st[k] = 0;
while(k!=0){
while(st[k] < n){
st[k] ++;
if(valid(k))
if(k == m)
tipar();
else{
k++;
st[k] = 0;
}
}
k--;
}
}
int main(){
f >> n >> m;
back();
return 0;
}