Cod sursa(job #2251006)
Utilizator | Data | 30 septembrie 2018 23:39:49 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,c[20];
void afis(int k)
{
int i;
for(i=1;i<=k;i++)
g<<c[i]<<' ';
g<<'\n';
}
void bck(int k)
{
int i;
for(i=c[k-1]+1;i<=n;i++)
{
c[k]=i;
if(k==m)
afis(k);
else
bck(k+1);
}
}
int main()
{
f>>n>>m;
bck(1);
return 0;
}