Pagini recente » Cod sursa (job #1201828) | Cod sursa (job #1119472) | Cod sursa (job #1246202) | Cod sursa (job #2137531) | Cod sursa (job #1457060)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,v[18];
bool verificare(int place)
{
if(( place == 1 )||(v[place]>v[place-1])) return 1;
else return 0;
}
void afisare()
{
int i=1;
g<<"\n";
for(i;i<=k;i++)g<<v[i]<<" ";
}
void backtr(int place)
{
int i = 1 ;
if ( place-1 == k ) afisare() ;
else for( i ; i<=n ; ++i )
{
v[place] = i;
if (verificare(place)) backtr(place+1) ;
}
}
int main()
{
f>>n>>k;
backtr(1);
f.close();
g.close();
return 0;
}