Cod sursa(job #202929)
Utilizator | Cohal Alexandru nautilus | Data | 12 august 2008 11:29:53 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream.h>
long n,k,i,s[20];
ofstream fout("combinari.out");
void afisare(long k)
{
long i;
for (i=1; i<=k; i++)
fout<<s[i]<<" ";
fout<<'\n';
}
void combinari(long p)
{
long i;
if (p==k+1) afisare(k);
else
for (i=s[p-1]+1; i<=n-k+p; i++)
{
s[p]=i;
combinari(p+1);
}
}
int main()
{
ifstream fin("combinari.in");
fin>>n>>k;
for (i=1; i<=n; i++)
s[i]=i;
combinari(1);
fin.close();
fout.close();
return 0;
}