Cod sursa(job #430570)
| Utilizator | Data | 31 martie 2010 10:13:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int sol[20],n,k;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afisare();
void bkt( int p)
{
if(p==k+1)
{
afisare();
return;
}
for(int i=1+sol[p-1];i<=n; ++i)
{
sol[p]=i;
bkt(p+1);
}
}
void afisare()
{
for(int i=1;i<=k;++i)
g<<sol[i]<<" ";
g<<'\n';
}
int main()
{
f>>n>>k;
bkt(1);
}
