Cod sursa(job #580245)
| Utilizator | Data | 12 aprilie 2011 21:06:38 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#define NMAX 20
using namespace std;
int a[NMAX], n, k;
ifstream f("combinari.in");
ofstream g("combinari.out");
void Afiseaza()
{
int i;
g<<a[1];
for(i=2; i<=k; ++i) g<<" "<<a[i];
g<<"\n";
}
void Comb(int h)
{
int i;
if (h==k+1) Afiseaza();
else
for (i=a[h-1]+1; i<=n; ++i)
{
a[h]=i;
Comb(h+1);
}
}
int main()
{
f>>n>>k;
Comb(1);
f.close();
g.close();
return 0;
}
