Mai intai trebuie sa te autentifici.
Cod sursa(job #1333970)
Utilizator | Data | 3 februarie 2015 19:45:12 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define DMAX 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
int sol[DMAX];
void comb(int k);
int main()
{
fin>>n>>m;
comb(1);
return 0;
}
void comb(int k)
{
int i;
if (k==m+1)
{
for (i=1; i<=m; ++i)
fout<<sol[i]<<' ';
fout<<'\n';
return;
}
for (i=sol[k-1]+1; i<=n-m+k; ++i)
{
sol[k]=i;
comb(k+1);
}
}