Cod sursa(job #1517559)
| Utilizator | Data | 4 noiembrie 2015 16:21:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, v[10],m;
void afisare()
{
for(int i=1;i<=m;i++) g<<v[i]<<' ';
g<<'\n';
}
void backt(int k)
{
for(int i=v[k-1]+1;i<=n;i++)
{
v[k]=i;
if(k==m) afisare();
else backt(k+1);
}
}
int main()
{
f>>n>>m;
backt(1);
return 0;
}
