Pagini recente » Cod sursa (job #2506581) | Cod sursa (job #1324254) | Cod sursa (job #2166399) | Cod sursa (job #2120039) | Cod sursa (job #1549919)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int fol[20],st[20];
int n,m;
void back(int k){
for(int i = st[k - 1] + 1; i <= n; i++){
if(fol[i] == 0){
fol[i] = 1;
st[k] = i;
if(k == m){
for(int i = 1; i <= m; i++){
g << st[i] <<" ";
}
g <<"\n";
}else
back(k + 1);
fol[i] = 0;
}
}
}
int main()
{
f >> n >> m;
back(1);
return 0;
}