Cod sursa(job #2216579)
Utilizator | Data | 27 iunie 2018 13:26:24 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int c[20],st[20],n,m;
void bck(int k)
{
for(int i=st[k-1]+1;i<=n;++i)
{
st[k]=i;
if(k==m){
for(int i=1;i<=m;++i)
g<<st[i]<<' ';
g<<'\n';
}
else
bck(k+1);
}
}
int main()
{
f>>n>>m;
bck(1);
}