Pagini recente » Cod sursa (job #2295361) | Cod sursa (job #3252438) | Cod sursa (job #2600701) | Cod sursa (job #2975218) | Cod sursa (job #3000917)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, m;
int a[101];
void write(){
for(int i = 1;i <= m;i++){
out << a[i] << ' ';
}
out << '\n';
}
void back(int k){
for(int i = a[k - 1] + 1;i <= n;i++){
a[k] = i;
if(k == m){
write();
}
else{
back(k + 1);
}
}
}
int main()
{
in >> n >> m;
back(1);
return 0;
}