Cod sursa(job #2265332)
Utilizator | Octavian Petrut Petru00 | Data | 20 octombrie 2018 22:57:41 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,st[19];
void Tipar()
{
int i;
for(i=1; i<=m; i++)
fout<<st[i]<<' ';
fout<<'\n';
}
int Valid(int k)
{
if(st[k]>st[k-1])return 1;
return 0;
}
void Back(int k)
{
if(k==m+1)Tipar();
else for(int i=1; i<=n; i++)
{
st[k]=i;
if(Valid(k))Back(k+1);
}
}
int main()
{
fin>>n>>m;
Back(1);
return 0;
}