Cod sursa(job #1160372)
Utilizator | Data | 30 martie 2014 15:12:48 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[20],n,k,h;
void scrie()
{
int i;
for (i=1;i<=k;i++)
g<<a[i]<<" ";
g<<'\n';
}
void combinari (int h)
{
int i;
if (h==k+1) scrie();
else
for (i=a[h-1]+1;i<=n-k+h;i++)
{
a[h]=i;
combinari(h+1);
}
}
int main()
{
f>>n>>k;
combinari(1);
return 0;
}