Cod sursa(job #2090747)
Utilizator | Data | 18 decembrie 2017 18:04:48 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int st[20],n,m;
void back (int k)
{
if(k>m)
{
for(int i=1; i<=m; i++)
out<<st[i]<<' ';
out<<'\n';
}
else
{
for(int i=st[k-1]+1; i<=n; i++)
{
st[k]=i;
back(k+1);
}
}
}
int main()
{
in>>n>>m;
back(1);
return 0;
}