Cod sursa(job #1644854)
Utilizator | Data | 10 martie 2016 09:54:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,s[19],l;
void afis()
{
for(int i=1;i<=l;i++)
g<<s[i]<<' ';
g<<'\n';
}
int valid (int k)
{
for(int i=1;i<k;i++)
if((s[i]==s[k]) ||(s[i]>s[k])) return 0;
return 1;
}
void genereaza(int k)
{
for(int i=1;i<=n;i++)
{
s[k]=i;
if(valid(k))
if(k==l) afis();
else genereaza(k+1);
}
}
int main()
{ f>>n>>l;
genereaza(1);
return 0;
}