Cod sursa(job #2173717)
| Utilizator | Data | 16 martie 2018 00:06:54 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[20];
int n,m;
void afisare()
{
int i;
for(i=1;i<=m;++i) fout<<x[i]<<" ";
fout<<'\n';
}
void back(int k)
{
int i;
for(i=x[k-1]+1;i<=n;++i)
{
x[k]=i;
if(k==m) afisare();
else back(k+1);
}
}
int main()
{
fin>>n>>m;
back(1);
return 0;
}
