Cod sursa(job #1442542)
| Utilizator | Data | 25 mai 2015 19:29:46 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream ka("combinari.in");
ofstream ki("combinari.out");
const int N_MAX = 18;
int n, k, v[N_MAX + 1];
void comb(int t, int nr)
{
if(t == k + 1)
{
for(int i = 1; i <= k; i++)
ki << v[i] << " ";
ki << '\n';
}
else
{
for(int i = nr; i <= n; i++)
{
v[t] = i;
comb(t + 1, i + 1);
}
}
}
int main()
{
ka >> n >> k;
comb(1, 1);
}
