Cod sursa(job #1248880)
Utilizator | Moise Alexandru moise_alexandru | Data | 26 octombrie 2014 10:34:38 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.95 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,q;
int p[20];
void afisare()
{
for(int i=1;i<=q;i++)
out<<p[i]<<" ";
out<<"\n";
}
void back(int k)
{
if(k==q+1)
{
afisare();
}
else
{
for(int i=1;i<=n;i++)
{
int ok=1;
for(int j=1;j<q;j++)
{
if(p[j]==i)
{
ok=0;
break;
}
}
if(ok==1)
{
if(k>=2 && i>p[k-1])
{
p[k]=i;
back(k+1);
}
if(k==1)
{
p[k]=i;
back(k+1);
}
}
}
}
}
int main()
{
in>>n>>q;
back(1);
return 0;
}