Cod sursa(job #714499)
| Utilizator | Data | 15 martie 2012 19:53:21 | |
|---|---|---|---|
| Problema | Combinari | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,j,st[100];
void tipar (int k)
{
for(int i=1;i<=k;i++)
out<<st[i]<<" ";
out<<endl;
}
int valid (int k)
{
if(st[k]<=st[k-1])
return 0;
return 1;
}
void back(int k)
{
for(int i=1;i<=n;i++)
{
st[k]=i;
if(valid(k))
{
if(k==j)
tipar(k);
else
back(k+1);
}
}
}
int main ()
{
in>>n>>j;
back(1);
in.close();
out.close();
}