Cod sursa(job #2132384)
Utilizator | Data | 15 februarie 2018 18:50:03 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int a[25],m,l;
ifstream f("combinari.in");
ofstream g("combinari.out");
void back(int k)
{
if(k == l+1)
{
for(int i = 1;i <= l;++i)
{
g<<a[i]<<' ';
}
g<<'\n';
}
else
{
for(int i = a[k-1] + 1;i <= m;++i)
{
a[k] = i;
back(k+1);
}
}
}
int main()
{
f>>m>>l;
back(1);
return 0;
}