Cod sursa(job #2376238)
| Utilizator | Data | 8 martie 2019 14:21:39 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n, k,v[20];
void Write()
{
for(int i = 1; i <= k; ++i)g<<v[i]<<" ";
g<<'\n';
}
void Gen(int nr)
{
if(nr > k)Write();
else
{
for(int i = v[nr-1] + 1; i <= n - (k - nr) ; ++i)
{
v[nr] = i;
Gen(nr + 1);
}
}
}
int main()
{
f>>n>>k;
Gen(1);
return 0;
}
