Pagini recente » Cod sursa (job #2767135) | Cod sursa (job #669202) | Cod sursa (job #903488) | Cod sursa (job #737274) | Cod sursa (job #248986)
Cod sursa(job #248986)
#include "fstream.h"
int n,s[100],l;
ifstream f("combinari.in");
ofstream g("combinari.out");
int valid(int k)
{
int v=1;
if (s[k-1]>s[k] || s[k-1]==s[k]) v=0;
return v;
}
void back(int k)
{
if (k==l+1)
{
for (int i=1;i<=l;i++) g<<s[i]<<" ";
g<<'\n';
}
else
{
for (int i=1;i<=n;i++)
{
s[k]=i;
if (valid(k)) back(k+1);
}
}
}
int main()
{
f>>n>>l;
back(1);
return 0;
}