Pagini recente » Cod sursa (job #2011333) | Monitorul de evaluare | Cod sursa (job #1797718) | Cod sursa (job #2008935) | Cod sursa (job #1554945)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,st[100],k;
void afisare (int p)
{cout<<endl;
int i;
for (i=1;i<=p;i++)
g<<st[i]<<" ";}
int sol (int p)
{return p==k;
}
int valid(int p)
{
if(p>1&&st[p]<=st[p-1])
return 0;
return 1;
}
void back(int p)
{
for(int pval=1;pval<=n;pval++)
{st[p]=pval;
if(valid(p))
if(sol(p))
afisare(p);
else
back(p+1);
}
}
int main ()
{int i;
f>>n>>k;
back (1);
return 0;
}