Pagini recente » Cod sursa (job #320940) | Borderou de evaluare (job #1569772) | Cod sursa (job #2806877) | Cod sursa (job #2072101) | Cod sursa (job #2723132)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k;
int perm[20];
void combinari(int a){
if(a == k){
for(int i = 1; i <= k; ++i)
out<<perm[i]<<" ";
out<<'\n';
}
else for(int j = perm[a] + 1; j <= n; ++j){
perm[a + 1] = j;
combinari(a + 1);
}
}
int main()
{
in>>n>>k;
combinari(0);
in.close();
out.close();
return 0;
}