Cod sursa(job #949975)
| Utilizator | Data | 15 mai 2013 16:36:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int n, k, sol[20];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void comb(int l)
{
if(l>k)
{
for(int i=1; i<=k; ++i)
fout<<sol[i]<<" ";
fout<<"\n";
}
else
{
for(int i=sol[l-1]+1; i<=n; ++i)
sol[l]=i, comb(l+1);
}
}
int main()
{
fin>>n>>k;
comb(1);
return 0;
}
