Pagini recente » Cod sursa (job #2340194) | Cod sursa (job #2462663) | Cod sursa (job #1423699) | Cod sursa (job #2866700) | Cod sursa (job #1820787)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int stv[15], n, k, fv[15];
void backu (int niv )
{int i;
if( niv == k+1 )
{
for( i=1; i<niv; i++ )
fout<<stv[i]<<" ";
fout<<"\n";
}
else
for( i=stv[niv-1] + 1 ; i<=n ; i++ )
{
stv[niv]=i;
backu(niv+1);
}
}
int main()
{
fin>>n>>k;
backu(1);
return 0;
}