Cod sursa(job #1752282)
| Utilizator | Data | 3 septembrie 2016 13:55:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#define nMax 19
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
int Sol[nMax];
void write()
{
for(int i=1; i<=m; i++)
fout<<Sol[i]<<" ";
fout<<'\n';
}
void back(int poz)
{
if(poz==m+1)
{
write();
return;
}
for(int i=Sol[poz-1]+1; i<=n; i++)
{
Sol[poz]=i;
back(poz+1);
}
}
int main()
{
fin>>n>>m;
back(1);
}
