Cod sursa(job #1689611)
Utilizator | Data | 14 aprilie 2016 13:33:19 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[19], n, k;
void gen(int q)
{
int i;
if (q == k+1)
{
for (i=1; i<=k; i++)
g<<a[i]<<' ';
g<<'\n'; return;
}
for (i = a[q-1]+1; i <= n-(k-q); i++)
{ a[q] = i; gen(q+1); }
}
int main()
{ f>>n>>k; gen(1);}