Pagini recente » Cod sursa (job #1029278) | Cod sursa (job #2862141) | Cod sursa (job #2129159) | Cod sursa (job #2548046) | Cod sursa (job #1014556)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n, k;
int sol[20];
void scrie ()
{
for (int i=1; i<=k; i++) g<<sol[i]<<' ';
g<<'\n';
}
void combinari (int pas)
{
if (pas==k+1) scrie ();
else
{
int l=n-k+pas;
// cout<<1;
for (int i=sol[pas-1]+1; i<=l; i++) {sol[pas]=i; combinari (pas+1);}
}
}
int main ()
{
f>>n>>k;
combinari (1);
return 0;
}