Cod sursa(job #161463)
Utilizator | Data | 18 martie 2008 11:05:57 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,a[21];
void afis()
{
for(int i=1;i<=k;i++)
g<<a[i]<<' ';
g<<'\n';
}
void comb(int niv)
{
if(niv==k+1)
afis();
else
for(int i=a[niv-1]+1;i<=n;i++)
{a[niv]=i;comb(niv+1);}
}int main()
{
f>>n>>k;comb(1);
return 0;
}