Cod sursa(job #1234798)
Utilizator | Hiticas Claudiu ClaudiuH | Data | 28 septembrie 2014 00:07:33 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, s[19];
void a ()
{
for(int i=1; i<=n; ++i)
fout<<s[i]<<" ";
fout<<'\n';
}
bool b (int k)
{
for (int i=1; i<=k; ++i)
{
if(s[k] <= s[i])
return false;
}
return true;
}
void c (int k)
{
if(k == k+1) a();
else
{
for(int i=1; i<=n; i++)
{
s[k] = i;
if (b(k)) c(k+1);
}
}
}
int main()
{
fin>>n>>m;
c(1);
}