Cod sursa(job #3284165)
Utilizator | Data | 11 martie 2025 10:49:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,st[200];
void Afis()
{
for(int i=1;i<=m;i++)
fout<<st[i]<<" ";
fout<<"\n";
}
void Back(int top)
{
if(top==m+1) Afis();
else for(int i=st[top-1]+1;i<=n;i++)
{
st[top]=i;
Back(top+1);
}
}
int main()
{
fin>>n>>m;
Back(1);
return 0;
}