Cod sursa(job #2240558)
| Utilizator | Data | 13 septembrie 2018 18:40:54 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, m;
long int sol[30];
void back(long int k)
{
if(k == m)
{
for (long int i = 1; i <= m; ++i)
fout << sol[i] << ' ';
fout << endl;
}
else {
for (long int i = sol[k] +1 ; i <= n; ++i){
sol[k+1]= i;
back(k+1);
}
}
}
int main()
{
fin >> n >> m;
back(0);
return 0;
}
