Cod sursa(job #1766063)
Utilizator | Data | 27 septembrie 2016 13:19:15 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream F ("combinari.in");
ofstream G ("combinari.out");
int n, s[20], k;
void Back(int l)
{
if (l == k)
{
for (int i = 1; i <= k; ++ i)
G << s[i] << " ";
G << '\n';
}
else
for (int i = s[l] + 1; i <= n; ++ i)
{
s[l + 1] = i;
Back(l + 1);
}
}
int main()
{
F >> n >> k;
Back(0);
return 0;
}