Cod sursa(job #2805711)
Utilizator | Data | 21 noiembrie 2021 19:37:17 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[20],n,k;
void afis(int m)
{
int i;
for(i=1;i<=k;i++)
g<<x[i]<<' ';
g<<'\n';
}
void back(int m)
{
int i;
if(m>k)
afis(m);
else for(i=max(x[m-1],0)+1;i<=n;i++)
{
x[m]=i;
back(m+1);
}
}
int main()
{
f>>n>>k;
back(1);
}