Cod sursa(job #1754267)
| Utilizator | Data | 7 septembrie 2016 19:51:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
int n;
int k;
int arr[18];
std::ifstream mama("combinari.in");
std::ofstream tata("combinari.out");
void
go(int index)
{
if (index == k)
{
for (int i = 0; i < k; ++i)
{
tata << arr[i] << ' ';
}
tata << '\n';
return;
}
for (int i = arr[index - 1] + 1; i <= n - k + index + 1; ++i)
{
arr[index] = i;
go(index + 1);
}
}
int main()
{
mama >> n >> k;
for (int i = 1; i <= n - k + 1; ++i)
{
arr[0] = i;
go(1);
}
return 0;
}
