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