Cod sursa(job #1800591)
Utilizator | Data | 7 noiembrie 2016 22:03:16 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,st[16];
void afisare()
{
for(int i=1;i<=m;i++)
g<<st[i]<<" ";
g<<'\n';
}
int control(int k)
{
for(int i=1;i<k;i++)
if(st[i]==st[k]) return 0;
return 1;
}
void back(int k)
{
int i,j;
if(k>m) afisare();
else
{
for(i=st[k-1]+1;i<=n;i++)
{
st[k]=i;
if(control(k)) back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}