Cod sursa(job #583328)
Utilizator | Data | 19 aprilie 2011 18:16:25 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream O_o("combinari.in");
ofstream o_O("combinari.out");
int a[23],n,k;
void back(int q)
{
int i;
if(q==k)
{
for(i=0;i<q;i++)
o_O<<a[i]<<' ';
o_O<<'\n';
}
else
{
for(i=a[q-1]+1;i<=n;i++)
{
a[q]=i;
back(q+1);
}
}
}
int main()
{
O_o>>n>>k;
O_o.close();
back(0);
o_O.close();
return 0;
}