Cod sursa(job #1135163)
Utilizator | Robert Szarvas robertkarol | Data | 7 martie 2014 13:40:34 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
long n,st[101],i,k,p;
void tip()
{
int i;
for(i=1;i<=p;i++)
fout<<st[i]<<" ";
fout<<"\n";
}
int valid (int k)
{
int i;
for(i=1;i<k;i++)
if (st[i]==st[k])
return 0;
if(k>=2)
if(st[k]<st[k-1])
return 0;
return 1;
}
void back (int k)
{
int i;
for(i=1;i<=n;i++)
{
st[k]=i;
if(valid(k))
if(k==p)
tip();
else back(k+1);
}
}
int main()
{
fin>>n>>p;
back(1);
return 0;
}