Cod sursa(job #1938243)
Utilizator | Data | 24 martie 2017 18:37:54 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, p[20];
void generare(int);
int main()
{
f>>n>>k;
generare (1);
return 0;
}
void generare(int m)
{
if(m==k+1)
{
for(int i=1;i<=k;i++)
g<<p[i]<<' ';
g<<'\n';
return;
}
for (int i=p[m-1]+1; i<=n; i++)
{
p[m]=i;
generare(m+1);
}
}