Cod sursa(job #1011010)
| Utilizator | Data | 16 octombrie 2013 06:57:18 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
# include <fstream>
using namespace std;
int st[100],i,j,m,n;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
void afisare (int p)
{
int i;
for(i=1;i<=p;i++)
cout << st[i]<<" ";
cout <<endl;
}
int valid(int p)
{
if(p>1 && st[p]<=st[p-1])
return 0;
else
return 1;
}
int k;
void back(int p)
{ int pval;
for (pval=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);
return 0;
}
