Cod sursa(job #1648511)
Utilizator | Data | 11 martie 2016 10:31:28 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[20] , maxx[20];
int n , k;
void bec(int vf)
{
if(vf - 1 == k)
{
for(int i = 1; i <= k; ++i)
g << a[i] << " ";
g << "\n";
}
else
{
for(int i = maxx[vf - 1] + 1; i <= n; ++i)
{
a[vf] = i;
maxx[vf] = max(maxx[vf - 1] , i);
bec(vf + 1);
}
}
}
int main()
{
f >> n >> k;
bec(1);
return 0;
}