Pagini recente » Cod sursa (job #43254) | Cod sursa (job #2469481) | Cod sursa (job #2931298) | Cod sursa (job #3255341) | Cod sursa (job #778522)
Cod sursa(job #778522)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[1000],k,n;
void print(int i)
{
int j;
for(j=1;j<=i;j++)
g<<a[j]<<" ";
g<<'\n';
}
int valid(int i)
{
int j;
for(j=1;j<i;j++)
if(a[i]<=a[i-1]) return 0;
return 1;
}
void back(int i)
{
int val;
for(val=1;val<=n;val++)
{
a[i]=val;
if(valid(i))
if(i==k) print(i);
else back(i+1);
}
}
int main()
{
f>>n>>k;
back(1);
return 0;
}