Cod sursa(job #2452679)
Utilizator | Data | 31 august 2019 18:45:39 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,st[20],m;
void tipar()
{
for(int i=1;i<=m;i++)
g<<st[i]<<" ";
g<<'\n';
}
void bt(int k)
{
for(int i=st[k-1]+1;i<=n;i++)
{
st[k]=i;
if(k==m)
tipar();
else
bt(k+1);
}
}
int main()
{
f>>n>>m;
bt(1);
}