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