Cod sursa(job #1245183)
Utilizator | Data | 18 octombrie 2014 18:51:57 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[10], n,m;
int valid (int k, int c)
{
if (k> 0 && st[k-1]>=c)
return 0;
return 1;
}
void tipar(int n)
{
for (int i=0; i<n; i++)
fout<<st[i]<<" ";
fout << "\n";
}
void back1(int k)
{
if (k==m)
tipar(m);
else
for (int i=1; i<=n; i++)
if (valid(k,i))
{
st[k]=i;
back1(k+1);
}
}
int main()
{
fin >> n>>m;
back1 (0);
return 0;
}