Cod sursa(job #2188807)
Utilizator | Data | 27 martie 2018 14:47:52 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int s[20],n,m;
void afisare( )
{
for (int i=1;i<=m;i++) fout << s[i] << " ";
fout << "\n";
}
void backt (int k)
{
if (k==m+1)
{
afisare ();
}
else
{
for (int i=s[k-1]+1;i<=n-m+k;i++)
{
s[k]=i;
backt (k+1);
}
}
}
int main()
{
fin >> n >> m;
backt (1);
return 0;
}