Cod sursa(job #1497993)
Utilizator | Data | 7 octombrie 2015 21:12:52 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,s[30];
void afisare()
{int i;
for(i=1;i<=m;i++)fout<<s[i]<<' ';
fout<<'\n';
}
void gen(int k)
{
if(k==m+1)afisare();
else for(int i=s[k-1]+1;i<=n;i++)
{
s[k]=i;
gen(k+1);
}
}
int main()
{
fin>>n>>m;
s[0]=0;
gen(1);
}