Pagini recente » Cod sursa (job #2843406) | Cod sursa (job #1839971) | Cod sursa (job #232203) | Cod sursa (job #1597937) | Cod sursa (job #900614)
Cod sursa(job #900614)
#include <fstream>
int x[100],n,l;
using namespace std;
ifstream eu("combinari.in");
ofstream tu("combinari.out");
int valid(int k)
{
int i,ok=1;
for(i=1;i<k;i++)
if(x[i]>=x[k])
ok=0;
return ok;
}
void afisare()
{
int i;
for(i=1;i<=l;i++)
tu<<x[i]<<" ";
tu<<"\n";
}
void back(int k)
{
int i;
for(i=1;i<=n;i++)
{
x[k]=i;
if(valid(k)==1)
if(k==l)
afisare();
else
back(k+1);
}
}
int main()
{
eu>>n;
eu>>l;
back(1);
return 0;
}