Cod sursa(job #1318241)
Utilizator | Data | 15 ianuarie 2015 19:34:30 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int st[999],n,k;
int valid(int p)
{
int ok=1;
for(int i=1;i<p;++i)
if(st[i]==st[p]) ok=0;
return ok;
}
void afisare(int p)
{
for(int i=1;i<n;++i)
cout<<st[i]<<" ";
cout<<endl;
}
void back(int p)
{
int pval;
for(pval=st[p-1]+1;pval<=n;++pval)
{ st[p]=pval;
//if(valid(p))
if(p==k) afisare(p);
else back(p+1);
}
}
int main()
{
cin>>n>>k;
back(1);
}