Cod sursa(job #162092)
Utilizator | Ozorchevici Ana Maria anamaria1 | Data | 19 martie 2008 13:36:06 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream.h>
ofstream g("combinari.out");
int s[19],n,k,q;
void init()
{s[q]=s[q-1];}
int succesor()
{if((s[q]<n)&&(q<=k))
{s[q]++;return 1;}
else return 0;
}
void tipar()
{int i;
for(i=1;i<=k;i++) g<<s[i]<<" ";
g<<'\n';
}
int main()
{ifstream f("combinari.in");
int as;
f>>n>>k;f.close();
q=1;
while(q)
{as=succesor();
if(as)
{if(q==k) tipar();
else {q++;init();}
}
else q--;
}
g.close();
return 0;
}