Cod sursa(job #1877456)
| Utilizator | Data | 13 februarie 2017 12:53:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[20], *p = st;
int dfs(const int n, const int k, const int cur = 1){
if(p-st == k) copy(st, p, ostream_iterator<int>(g, " ")), g << '\n';
else for(int i = cur; i <= n; ++i)
*p++ = i, dfs(n, k, i+1), --p; }
int main(){
int n, k;
f >> n >> k;
dfs(n, k);
return 0; }
