Cod sursa(job #798578)
Utilizator | Data | 16 octombrie 2012 19:32:38 | |
---|---|---|---|
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,a[20];
void afisare()
{
int i;
for(i=1;i<=m;i++)
g<<a[i]<<' ';
g<<'\n';
}
void comb(int k)
{
int i;
for(i=a[k-1]+1;i<=n;i++)
{
a[k]=i;
if(k==m)
afisare();
else
comb(k+1);
}
}
int main()
{
f>>n>>m;
comb(1);
return 0;
}