Cod sursa(job #1135182)
Utilizator | Data | 7 martie 2014 13:56:10 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int st[19],n,k,p;
void tip ()
{
int i;
for (i=1;i<=p;i++)
g<<st[i]<<' ';
g<<'\n';
}
void Back (int k)
{
int i;
for (i=1;i<=n;i++)
{
st[k]=i;
for (i=st[k-1]+1;i<=n;i++)
{
st[k]=i;
if (k==p)
tip();
else Back (k+1);}
}
}
int main()
{
f>>n>>p;
Back (1);
return 0;
}