Cod sursa(job #3038269)
Utilizator | Data | 27 martie 2023 10:05:00 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int x[20],n,m,j;
void f (int pas)
{
if (pas==m+1)
{
for (int i=1; i<=m; i++)
fout<<x[i]<<" ";
fout<<"\n";
}
else
{
for (int i=j+1; i<=n; i++)
{
j=i;
x[pas]=i;
f (pas+1);
}
}
}
int main()
{
fin>>n>>m;
j=0;
f (1);
return 0;
}