Cod sursa(job #2941858)
Utilizator | Serban Alexandru AlexSerban21 | Data | 18 noiembrie 2022 14:33:56 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int x[30],n,m;
int vv (int pas)
{
if (pas>1&&x[pas]<=x[pas-1])
return 0;
return 1;
}
void f (int pas)
{
if (pas==m+1)
{
for (int i=1; i<=m; i++)
fout<<x[i]<<" ";
fout<<"\n";
}
else
{
for (int i=1; i<=n; i++)
{
x[pas]=i;
if (vv(pas)==1)
f (pas+1);
}
}
}
int main()
{
fin>>n>>m;
f (1);
return 0;
}