Cod sursa(job #1723379)
| Utilizator | Data | 30 iunie 2016 15:03:14 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
int a[30], n, k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void Afis()
{
int i;
for (i = 1; i <= k; ++i)
fout << a[i] << " ";
fout << "\n";
}
void Gen(int top)
{
if (top == k + 1) Afis();
else
for (int i = 1 + a[top-1]; i <= n; i++)
{
a[top] = i;
Gen(top + 1);
}
}
int main()
{
fin >> n >> k;
Gen(1);
return 0;
}
