Cod sursa(job #3144867)
Utilizator | Data | 10 august 2023 23:11:46 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n,m,x[20];
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;
}