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