Cod sursa(job #613938)
| Utilizator | Data | 5 octombrie 2011 09:16:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | bkt1_oct2011 | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,sol[25];
void afisare()
{
for(int i=1;i<=k;++i)
g<<sol[i]<<" ";
g<<"\n";
}
void bkt(int p)
{
int i;
if (p-1==k)
{afisare(); return;}
else
for(i=1+sol[p-1]; i<=n;++i)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
f>>n>>k;
bkt(1);
return 0;
}
