Pagini recente » Cod sursa (job #1780395) | Cod sursa (job #1866178) | Cod sursa (job #1564656) | Cod sursa (job #1934708) | Cod sursa (job #958012)
Cod sursa(job #958012)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[15],n,m;
int valid(int k)
{
if((k>1)&&(x[k-1]>=x[k]))
return(0);
return(1);
}
void afisare()
{
int i;
for(i=1;i<=m;i++)
g<<x[i]<<" ";
g<<"\n";
}
void back(int k)
{
int i;
for(i=1;i<=n;i++)
{
x[k]=i;
if(valid(k))
if(k==m)
afisare();
else
{
back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}