Cod sursa(job #722451)
| Utilizator | Data | 24 martie 2012 17:00:02 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int N=19;
int n,k,sol[N];
void write()
{
int i;
for(i=1;i<=k;i++)
out<<sol[i]<<" ";
out<<"\n";
}
void bkt(int p)
{
int i;
if(p-1==k)
{
write();
return;
}
for(i=sol[p-1]+1;i<=n-k+p;i++)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
in>>n>>k;
bkt(1);
return 0;
}